Show simple item record

dc.contributor.authorVaradhan, Gokulen_US
dc.contributor.authorKrishnan, Shankaren_US
dc.contributor.authorSriram, TVNen_US
dc.contributor.authorManocha, Dineshen_US
dc.contributor.editorRoberto Scopigno and Denis Zorinen_US
dc.date.accessioned2014-01-29T09:19:55Z
dc.date.available2014-01-29T09:19:55Z
dc.date.issued2004en_US
dc.identifier.isbn3-905673-13-4en_US
dc.identifier.issn1727-8384en_US
dc.identifier.urihttp://dx.doi.org/10.2312/SGP/SGP04/241-250en_US
dc.description.abstractWe address the problem of computing a topology preserving isosurface from a volumetric grid using Marching Cubes for geometry processing applications. We present a novel topology preserving subdivision algorithm to generate an adaptive volumetric grid. Our algorithm ensures that every grid cell satisfies two local geometric criteria: a complex cell criterion and a star-shaped criterion. We show that these two criteria are sufficient to ensure that the surface extracted from the grid using Marching Cubes has the same genus and connectedness as that of the exact isosurface. We use our subdivision algorithm for accurate boundary evaluation of CSG combinations of polyhedra and low degree algebraic primitives, translational motion planning, model simplification and remeshing. The running time of our algorithm varies between a few seconds for simple models composed of a few thousand triangles to tens of seconds for complex polyhedral models represented using hundreds of thousands of triangles.en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modelingen_US
dc.titleTopology Preserving Surface Extraction Using Adaptive Subdivisionen_US
dc.description.seriesinformationSymposium on Geometry Processingen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record