Smooth hierarchical surface triangulations
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Presents a new method to produce a hierarchical set of triangle meshes that can be used to blend different levels of detail in a smooth fashion. The algorithm produces a sequence of meshes /spl Mscr//sub 0/, /spl Mscr//sub 1/, /spl Mscr//sub 2/..., /spl Mscr//sub n/, where each mesh /spl Mscr//sub i/ can be transformed to mesh /spl Mscr//sub i+1/ through a set of triangle-collapse operations. For each triangle, a function is generated that approximates the underlying surface in the area of the triangle, and this function serves as a basis for assigning a weight to the triangle in the ordering operation, and for supplying the point to which the triangles are collapsed. This technique allows us to view a triangulated surface model at varying levels of detail while insuring that the simplified mesh approximates the original surface well.Keywords
This publication has 13 references indexed in Scilit:
- Mesh reduction with error controlPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Generalized unstructured decimation [computer graphics]IEEE Computer Graphics and Applications, 1996
- Hierarchical triangulation for multiresolution surface descriptionACM Transactions on Graphics, 1995
- Multiresolution analysis of arbitrary meshesPublished by Association for Computing Machinery (ACM) ,1995
- A data reduction scheme for triangulated surfacesComputer Aided Geometric Design, 1994
- Mesh optimizationPublished by Association for Computing Machinery (ACM) ,1993
- Curvature Approximation for Triangulated SurfacesPublished by Springer Nature ,1993
- Decimation of triangle meshesACM SIGGRAPH Computer Graphics, 1992
- Re-tiling polygonal surfacesACM SIGGRAPH Computer Graphics, 1992
- Marching cubes: A high resolution 3D surface construction algorithmACM SIGGRAPH Computer Graphics, 1987