Abstract
This article discusses an enhanced polygonization algorithm for variational implicit surfaces. The polygonization scheme is a simple hierarchical adaptation of the Marching Cubes algorithm which takes advantage of some properties of variational implicits to produce a proper and efficient sampling of the surface. The technique exploits the fact that variational objects exhibit properties akin to Euclidean distance metrics, thus allowing the polygonizer to quickly ascertain that a given volume does not contain the surface. Timings show that this technique tends to perform faster than Bloomenthal's continuation polygonizer [Bloomenthal J. Graphics Gems IV 1994;324–49].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
