Reports de recerca
Recent Submissions
-
SP: a program for driving instrumentation for a PC
(1990-11-21)
External research report
Open Access -
Modelat sòlid: realització d'operacions booleanes amb model de fronteres
(1989)
External research report
Open AccessAquest treball presenta un algorisme per realitzar operacions booleanes amb model de fronteres. Es basa en un algorisme en 2D per polígons. L'algorisme consta de 4 passos. Els tres primers son comuns a qualsevol operació ... -
A survey of computer animation
(1987-05)
External research report
Open AccessA survey on computer animation is presented with three specific goals: - To clarify what people understand by computer animation. - To separate the different aspects of computer animation and underline its main problems. - ... -
Implementación de un algoritmo vectorial para la eliminación de partes ocultas en escenas poliédricas
(1987-12)
External research report
Open AccessAn important problem in the dessign of Solid Modelling Systems is the one related with the realistic model rendering. Up until now, several algorithms dealing with this topic have been developed. Most of these algorithms ... -
The Extreme Vertices Model (EVM) for orthogonal polyhedra
(1997-01)
External research report
Open AccessOrthogonal Polyhedra offer a worthy-to-explore simplification. In this work we propose a specific model for representing orthogonal polyhedra that allows simple and robust algorithms for performing the most usual and ... -
La modularidad de la mente: origen y transformación de una metáfora
(2001-05)
External research report
Open AccessIn this work we try to make clear the actual reference of the modular hypothesis of the mind, and the epistemological and ontological relevance of the metaphor. We also make a critical evaluation of the contribution of ... -
h-graphs: A new representation for tree decompositions of graphs
(2014)
External research report
Open AccessIn geometric constraint solving, well constrained geometric problems can be abstracted as Laman graphs. If the graph is tree decomposable, the constraint-based geometric problem can be solved by a Decomposition-Recombination ... -
On tree decomposability of Henneberg graphs
(2014)
External research report
Open AccessIn this work we describe an algorithm that generates well constrained geometric constraint graphs which are solvable by the tree-decomposition constructive technique. The algorithm is based on Henneberg constructions and ... -
Orientation, sphericity and roundness evaluation of particles using alternative 3D representations
(2014)
External research report
Open AccessSphericity and roundness indices have been used mainly in geology to analyze the shape of particles. In this paper, geometric methods are proposed as an alternative to evaluate the orientation, sphericity and roundness ... -
A practical and robust method to compute the boundary of three-dimensional axis-aligned boxes
(2013)
External research report
Open AccessThe union of axis-aligned boxes results in a constrained structure that is advantageous for solving certain geometrical problems. A widely used scheme for solid modelling systems is the boundary representation (Brep). We ... -
Back-to-front orderings of triangles in triangulated terrains over regular grids
(2013)
External research report
Open AccessIn this work we report on a complete and correct set of configurations to realistically rendering triangulated heightfields dedined over regular grids by visiting triangles in a back-to-front order. The experiments conducted ... -
Interaction techniques in virtual environments
(2013)
External research report
Open AccessVirtual environments are used in very diverse applications: from leisure games to professional training and rehabilitation systems. In these applications, users interact with the elements of the environments through avatars ...
RSS 1.0