Constructing hierarchies for triangle meshes

We present a method to produce a hierarchy of triangle meshes that can be used to blend different levels of detail in a smooth fashion. The algorithm produces a sequence of meshes M/sub 0/, M/sub 1/, M/sub 2/..., M/sub n/, where each mesh M/sub i/ can be transformed to mesh M/sub i+1/ through a set...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on visualization and computer graphics 1998-04, Vol.4 (2), p.145-161
Main Authors: Gieng, T.S., Hamann, B., Joy, K.I., Schussman, G.L., Trotts, I.J.
Format: Article
Language:English
Subjects:
Computational modeling
Data visualization
Image generation
Image resolution
Legged locomotion
Power system modeling
Rendering (computer graphics)
Shape
Solid modeling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a method to produce a hierarchy of triangle meshes that can be used to blend different levels of detail in a smooth fashion. The algorithm produces a sequence of meshes M/sub 0/, M/sub 1/, M/sub 2/..., M/sub n/, where each mesh M/sub i/ can be transformed to mesh M/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 points to which the triangles are collapsed. The algorithm produces a limited number of intermediate meshes by selecting, at each step, a number of triangles that can be collapsed simultaneously. 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.
ISSN:1077-2626
1941-0506
DOI:10.1109/2945.694956