Constructing hierarchies for triangle meshes

T.S. Gieng, B. Hamann, K.I. Joy, G.L. Schussman, I.J. Trotts
1998 IEEE Transactions on Visualization and Computer Graphics  
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 0 0 , 0 1 , 0 2 , ..., 0 n , where each mesh 0 i can be transformed to mesh 0 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
more » ... 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.
doi:10.1109/2945.694956 fatcat:2fdtifmbgbe5tcu7w2z4cjy464