Please use this identifier to cite or link to this item:
logo share SHARE BASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE

The discretized polyhedra simplification (DPS): a framework for polyhedra simplification based on decomposition schemes

AuthorsAndújar Gran, Carlos; Ayala Vallespi, Dolors; Brunet Crosa, Pere
KeywordsPattern recognition
Computer vision
Issue Date1999
CitationTechnical Report IRI-DT-99-00, Institut de Robòtica i Informàtica Industrial, CSIC-UPC, 1999.
AbstractThis work discusses simplification algorithms for the generation of a multiresolution family of solid representations from an initial polyhedral solid. We introduce the Discretized Polyhedra Simplification (DPS), a framework for polyhedra simplification using space decomposition models. The DPS is based on a new error measurement and provides a sound scheme for error-bounded, geometry and topology simplification while preserving the validity of the model. A method following this framework, Direct DPS, is presented and discussed. Direct DPS uses an octree for topology simplification and error control, and generates valid solid representations. Our method is also able to generate approximations which do not interpenetrate the original model, either being completely contained in the input solid or bounding it. Unlike most of the current methods, our algorithm can deal and also produces faces with arbitrary complexity. An extension of the Direct method for appearance preservation, called Hybrid DPS, is also discussed.
Appears in Collections:(IRII) Informes y documentos de trabajo

Files in This Item:
File Description SizeFormat
doc1.pdf1,33 MBAdobe PDFThumbnail
Show full item record
Review this work

Page view(s)

checked on May 19, 2022


checked on May 19, 2022

Google ScholarTM


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.