Abstract
The authors review the principal algorithms for the polygonization of implicit surfaces and provide a framework for identifying their conceptual similarities and practical differences. The algorithms' merits are evaluated according to topological disambiguation, implementation complexity, and triangle count. Special attention is devoted to the ambiguity problem, and proposed solutions are analyzed in the context of consistency and correctness. It is argued that consistency suffices for many purposes and is achievable with single-entry tetrahedral or cubical tables. >
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.
