Reliable Implicit Surface Polygonization using Visibility Mapping
Gokul Varadhan, Shankar Krishnan, Liangjun Zhang, Dinesh Manocha
Eurographics Symposium on Geometry Processing, 2006, pp. 211--221.
Abstract: We 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.
Article URL: http://dx.doi.org/10.2312/SGP/SGP06/211-221
BibTeX format:
@inproceedings{Varadhan:2006:RIS,
  author = {Gokul Varadhan and Shankar Krishnan and Liangjun Zhang and Dinesh Manocha},
  title = {Reliable Implicit Surface Polygonization using Visibility Mapping},
  booktitle = {Eurographics Symposium on Geometry Processing},
  pages = {211--221},
  year = {2006},
}
Search for more articles by Gokul Varadhan.
Search for more articles by Shankar Krishnan.
Search for more articles by Liangjun Zhang.
Search for more articles by Dinesh Manocha.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."