Constructing hierarchies for triangle meshes

TS Gieng, B Hamann, KI Joy… - … on Visualization and …, 1998 - ieeexplore.ieee.org
TS Gieng, B Hamann, KI Joy, GL Schussman, IJ Trotts
IEEE Transactions on Visualization and Computer Graphics, 1998ieeexplore.ieee.org
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 …
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.
ieeexplore.ieee.org