The meshing of 3D objects, when the surface of the object is a cloud of points, is realized in general by triangles using the algorithm of Delaunay. Another possibility exists via the dual algorithm, the Voronoi diagram. An alternative to the algorithm of Voronoi is proposed by the utilization of a Voronoi organized meshes. Vertices of valence 3, forming in general "hexagons" and some "plygons" compose by 5,7,8... edges to insure the curvature. An example is the fullerences. Fullerences are symetrical closed convex graphite shells, consisting of 12 pentagons and various numbers of hexagons, for which the gaussian curvature is positive. We prasent in this paper the different algorithms of subdivision and compression applied on this type of surfaces.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.