An evaluation of implicit surface tilers

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