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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Keywords

CorrectnessComputer scienceAmbiguityConsistency (knowledge bases)Context (archaeology)Theoretical computer scienceAlgorithmInformation retrievalData miningArtificial intelligenceProgramming language

Affiliated Institutions

Related Publications

Publication Info

Year
1993
Type
article
Volume
13
Issue
6
Pages
33-41
Citations
172
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

172
OpenAlex

Cite This

Paul Ning, Jules Bloomenthal (1993). An evaluation of implicit surface tilers. IEEE Computer Graphics and Applications , 13 (6) , 33-41. https://doi.org/10.1109/38.252552

Identifiers

DOI
10.1109/38.252552