Show simple item record

dc.contributor.authorAndújar Gran, Carlos Antonio
dc.contributor.authorBrunet Crosa, Pere
dc.contributor.authorAyala Vallespí, M. Dolors
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.identifier.citationAndujar, C., Brunet, P., Ayala, D. "Robust topology simplification". 2000.
dc.description.abstractThis paper deals with simplification algorithms for generating coarse-level approximations of both geometrically and topologically complex models. Our main contribution is a new framework called DPS which models a family of topology-reducing simplification algorithms which have in common the use of an intermediate discrete representation of the scene. DPS provides a robust scheme for aggressive simplification of objects and assemblies while guaranteeing valid, error-bounded solid representations. DPS also enables approximations that do not interpenetrate the original model, either being completely contained in the input solid or bounding it. Several instances of DPS algorithms are presented and discussed. We show that DPS methods perform significantly better than other surface-based approaches when simplifying topologically-rich models such as scene parts and complex mechanical assemblies.
dc.format.extent20 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.otherSimplification algorithms
dc.subject.otherComplex models
dc.titleRobust topology simplification
dc.typeExternal research report
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
local.citation.authorAndujar, C.; Brunet, P.; Ayala, D.

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder