Campuses:

Efficient Processing of Large 3D Meshes

Thursday, April 26, 2001 - 9:30am - 10:30am
Keller 3-180
Due to their simplicity triangle meshes are often used to represent geometric surfaces. Their main drawback is the large number of triangles that are required to represent a smooth surface. This problem has been addressed by a large number of mesh simplification algorithms which reduce the number of triangles and approximate the initial mesh. Hierarchical triangle mesh representations provide access to a triangle mesh at a desired resolution, without omitting any information.

In this talk we present an infrastructure for discrete geometry processing, including algorithms for 3D reconstruction, curvature computation, mesh reduction, geometric mesh smoothing, and multiresolution editing of arbitrary unstructured tringle meshes.

In particular, we will demonstrate how mesh reduction and geometric mesh smoothing can be combined to provide a powerful and numerically efficient multiresolution smoothing and editing paradigm.