Mostra el registre d'ítem simple

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.date.accessioned2016-11-09T14:48:34Z
dc.date.available2016-11-09T14:48:34Z
dc.date.issued2000-05
dc.identifier.citationAndujar, C., Brunet, P., Ayala, D. "Robust topology simplification". 2000.
dc.identifier.urihttp://hdl.handle.net/2117/96409
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.language.isoeng
dc.relation.ispartofseriesLSI-00-35-R
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.otherSimplification algorithms
dc.subject.otherDSP
dc.subject.otherComplex models
dc.subject.otherTopology
dc.titleRobust topology simplification
dc.typeExternal research report
dc.rights.accessOpen Access
local.identifier.drac636558
dc.description.versionPostprint (published version)
local.citation.authorAndujar, C.; Brunet, P.; Ayala, D.


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple