Different geometric structures are investigated in the context of discrete surface representation. It is shown that minimal representations (i.e., polyhedra) can be provided by a surface-based method using nearest neighbors structures or by a volume-based method using the Delaunay triangulation. Both approaches are compared with respect to various criteria, such as space requirements, computation time, constraints on the distribution of the points, facilities for further calculations, and agreement with the actual shape of the objec
In the Euclidean plane, a Delaunay triangulation can be characterized by the requirement that the ci...
In this paper, we investigate the use of weighted triangulations as discrete, augmented approximatio...
Surface geometry is commonly represented by a collection of primitives. Conforming representations c...
Frequently, data in scientific computing is in its abstract form a finite point set in space, and it...
Frequently, data in scientific computing is in its abstract form a finite point set in space, and it...
International audienceThree-dimensional surface meshes are the most common discrete representation o...
International audienceThree-dimensional surface meshes are the most common discrete representation o...
International audienceThree-dimensional surface meshes are the most common discrete representation o...
International audienceThe three-dimensional A-shape is based on a mathematical formalism which deter...
This paper explores the possibility of approximating a surface by a trihedral polygonal mesh plus so...
International audienceThe three-dimensional A-shape is based on a mathematical formalism which deter...
CAD system is useful to define and input any artificial 3-dimensional configuration into computer, b...
In this work we present the principles and applications of geometry simplification, focusing on sim...
In this work we present the principles and applications of geometry simplification, focusing on si...
CAD system is useful to define and input any artificial 3-dimensional configuration into computer, b...
In the Euclidean plane, a Delaunay triangulation can be characterized by the requirement that the ci...
In this paper, we investigate the use of weighted triangulations as discrete, augmented approximatio...
Surface geometry is commonly represented by a collection of primitives. Conforming representations c...
Frequently, data in scientific computing is in its abstract form a finite point set in space, and it...
Frequently, data in scientific computing is in its abstract form a finite point set in space, and it...
International audienceThree-dimensional surface meshes are the most common discrete representation o...
International audienceThree-dimensional surface meshes are the most common discrete representation o...
International audienceThree-dimensional surface meshes are the most common discrete representation o...
International audienceThe three-dimensional A-shape is based on a mathematical formalism which deter...
This paper explores the possibility of approximating a surface by a trihedral polygonal mesh plus so...
International audienceThe three-dimensional A-shape is based on a mathematical formalism which deter...
CAD system is useful to define and input any artificial 3-dimensional configuration into computer, b...
In this work we present the principles and applications of geometry simplification, focusing on sim...
In this work we present the principles and applications of geometry simplification, focusing on si...
CAD system is useful to define and input any artificial 3-dimensional configuration into computer, b...
In the Euclidean plane, a Delaunay triangulation can be characterized by the requirement that the ci...
In this paper, we investigate the use of weighted triangulations as discrete, augmented approximatio...
Surface geometry is commonly represented by a collection of primitives. Conforming representations c...