By Topic

An evaluation of implicit surface tilers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ning, P. ; Stanford Univ., CA, USA ; Bloomenthal, J.

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.<>

Published in:

Computer Graphics and Applications, IEEE  (Volume:13 ,  Issue: 6 )