*Wissenschaftliches Programm* *Liste der Vortragenden*

**Sektion 12**

Donnerstag, 21.09.2000,
14.00–14.50 Uhr, WIL A 124

#### Hans-Peter Seidel, Max-Planck-Institut für Informatik, Saarbrücken

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, reverse engineering, mesh reduction, interactive multiresolution
modelling and progressive transmission of arbitrary unstructured tringle meshes.