DocumentCode :
997832
Title :
An evaluation of implicit surface tilers
Author :
Ning, Paul ; Bloomenthal, Jules
Author_Institution :
Stanford Univ., CA, USA
Volume :
13
Issue :
6
fYear :
1993
Firstpage :
33
Lastpage :
41
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.<>
Keywords :
computational geometry; computer graphics; data visualisation; ambiguity problem; consistency; correctness; cubical tables; implementation complexity; implicit surface tilers evaluation; polygonization; single-entry tetrahedral; topological disambiguation; triangle count; Computational modeling; Data visualization; Grid computing; Interpolation; Isosurfaces; Shape; Solid modeling; Topology;
fLanguage :
English
Journal_Title :
Computer Graphics and Applications, IEEE
Publisher :
ieee
ISSN :
0272-1716
Type :
jour
DOI :
10.1109/38.252552
Filename :
252552
Link To Document :
بازگشت