Interactive Multi-Resolution Modeling on Arbitrary Meshes

During the last years the concept of multi-resolution modeling has gained special attention in many fields of computer graphics and geometric modeling. In this paper we generalize powerful multiresolution techniques to arbitrary triangle meshes without requiring subdivision connectivity. Our major observation is that the hierarchy of nested spaces which is the structural core element of most multi-resolution algorithms can be replaced by the sequence of intermediate meshes emerging from the application of incremental mesh decimation. Performing such schemes with local frame coding of the detail coefficients already provides effective and efficient algorithms to extract multi-resolution information from unstructured meshes. In combination with discrete fairing techniques, i.e., the constrained minimization of discrete energy functionals, we obtain very fast mesh smoothing algorithms which are able to reduce noise from a geometrically specified frequency band in a multiresolution de...

• Type: Conference
• Year: 1998
• Where: SIGGRAPH
• Authors: Leif Kobbelt, Swen Campagna, Jens Vorsatz, Hans-Peter Seidel
• Keywords: Computer Graphics, Local Frame Coding, Mesh, Mesh Smoothing Algorithms, SIGGRAPH 1998