In this course, the storage costs of current 3D shape representations were analyzed, and several recent schemes for lossy and loss-less geometry compression were described. In addition to compression schemes for triangle meshes, which require as low as one byte of storage per triangle, more aggressive surface fitting schemes and multiresolution, progressive-refinement approaches were discussed. Along with surface simplification or decimation methods, these approaches can be regarded as lossy compression schemes.
Prerequisites
Some familiarity with the basic concepts of meshes and the standard representations of polygonal models.
Topics Covered
Recent schemes for lossy and loss-less compression of triangle and polygonal meshes, including surface fitting, multi-resolution, and progressive approaches.
Organizers
Gabriel Taubin
IBM T.J. Watson Research Center
Jarek Rossignac
Georgia Institute of Technology
Lecturers
Michael Deering
Sun Microsystems, Inc.
Hugues Hoppe
Microsoft Research
Jarek Rossignac
Georgia Institute of Technology
Peter Schröder
California Institute of Technology
Hans-Peter Seidel
University of Erlangen
Gabriel Taubin
IBM T.J. Watson Research Center
