Reliable Implicit Surface Polygonization using Visibility Mapping

Simple item page
dc.contributor.authorVaradhan, Gokulen_US
dc.contributor.authorKrishnan, Shankaren_US
dc.contributor.authorZhang, Liangjunen_US
dc.contributor.authorManocha, Dineshen_US
dc.contributor.editorAlla Sheffer and Konrad Polthieren_US
dc.date.accessioned2014-01-29T08:14:07Z
dc.date.available2014-01-29T08:14:07Z
dc.date.issued2006en_US
dc.description.abstractWe present a new algorithm to compute a topologically and geometrically accurate triangulation of an implicit surface. Our approach uses spatial subdivision techniques to decompose a manifold implicit surface into star-shaped patches and computes a visibilty map for each patch. Based on these maps, we compute a homeomorphic and watertight triangulation as well as a parameterization of the implicit surface. Our algorithm is general and makes no assumption about the smoothness of the implicit surface. It can be easily implemented using linear programming, interval arithmetic, and ray shooting techniques. We highlight its application to many complex implicit models and boundary evaluation of CSG primitives.en_US
dc.description.seriesinformationSymposium on Geometry Processingen_US
dc.identifier.isbn3-905673-24-Xen_US
dc.identifier.issn1727-8384en_US
dc.identifier.urihttps://doi.org/10.2312/SGP/SGP06/211-221en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectKeywords: contouring, Marching Cubes, set operations, implicit modeling, topologyen_US
dc.titleReliable Implicit Surface Polygonization using Visibility Mappingen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
211-221.pdf
Size:
450.23 KB
Format:
Adobe Portable Document Format
Download
Collections
SGP06: Eurographics Symposium on Geometry Processing