Publication 1998 Issue No. 2 - April-June Abstract - Constructing Hierarchies for Triangle Meshes
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Tran S. Gieng Articles by Bernd Hamann Articles by Kenneth I. Joy Articles by Gregory L. Schussman Articles by Issac J. Trotts
Constructing Hierarchies for Triangle Meshes
April-June 1998 (vol. 4 no. 2)
pp. 145-161
 ASCII Text x Tran S. Gieng, Bernd Hamann, Kenneth I. Joy, Gregory L. Schussman, Issac J. Trotts, "Constructing Hierarchies for Triangle Meshes," IEEE Transactions on Visualization and Computer Graphics, vol. 4, no. 2, pp. 145-161, April-June, 1998.
 BibTex x @article{ 10.1109/2945.694956,author = {Tran S. Gieng and Bernd Hamann and Kenneth I. Joy and Gregory L. Schussman and Issac J. Trotts},title = {Constructing Hierarchies for Triangle Meshes},journal ={IEEE Transactions on Visualization and Computer Graphics},volume = {4},number = {2},issn = {1077-2626},year = {1998},pages = {145-161},doi = {http://doi.ieeecomputersociety.org/10.1109/2945.694956},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Visualization and Computer GraphicsTI - Constructing Hierarchies for Triangle MeshesIS - 2SN - 1077-2626SP145EP161EPD - 145-161A1 - Tran S. Gieng, A1 - Bernd Hamann, A1 - Kenneth I. Joy, A1 - Gregory L. Schussman, A1 - Issac J. Trotts, PY - 1998KW - Mesh simplificationKW - triangle meshesKW - level-of-detail representationKW - shape approximationKW - multiresolution.VL - 4JA - IEEE Transactions on Visualization and Computer GraphicsER -

Abstract—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 ${\cal M}_0, {\cal M}_1, {\cal M}_2, ..., {\cal M}_n,$ where each mesh ${\cal M}_i$ can be transformed to mesh ${\cal M}_{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.

Index Terms:
Mesh simplification, triangle meshes, level-of-detail representation, shape approximation, multiresolution.
Citation:
Tran S. Gieng, Bernd Hamann, Kenneth I. Joy, Gregory L. Schussman, Issac J. Trotts, "Constructing Hierarchies for Triangle Meshes," IEEE Transactions on Visualization and Computer Graphics, vol. 4, no. 2, pp. 145-161, April-June 1998, doi:10.1109/2945.694956