Abstract

Automatic simplification of polyhedral objects is a major topic in many computer graphics applications. In this work, simplification algorithms for the generation of a multiresolution family of solid representations from an initial polyhedral solid are discussed. We introduce the Discretized Polyhedra Simplification (DPS), a framework for polyhedra simplification using space decomposition models. DPS is based on a new error distance and provides a sound scheme for error-bounded, geometry and topology simplification while preserving the validity of the model. A method following this framework, trihedral DPS, is presented and discussed. Trihedral DPS uses an octree for topology simplification and error control, and generates valid solid representations. Our method is also able to generate approximations that do not interpenetrate the original model, either being completely contained in the input solid or bounding it. Unlike most of the current methods, restricted to triangle meshes, our ...

Citations