An evaluation of implicit surface tilers
- 1 November 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 13 (6), 33-41
- https://doi.org/10.1109/38.252552
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
This publication has 16 references indexed in Scilit:
- The asymptotic decider: resolving the ambiguity in marching cubesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Octree Pruning for Variable-Resolution IsosurfacesPublished by Springer Science and Business Media LLC ,1992
- Constructing isosurfaces from CT dataIEEE Computer Graphics and Applications, 1991
- Adaptive isosurface generation in a distortion-rate frameworkPublished by SPIE-Intl Soc Optical Eng ,1991
- Visualizing and modeling scattered multivariate dataIEEE Computer Graphics and Applications, 1991
- Topological considerations in isosurface generation extended abstractACM SIGGRAPH Computer Graphics, 1990
- Adaptive polygonalization of implicitly defined surfacesIEEE Computer Graphics and Applications, 1990
- Surface mapping brain function on 3D modelsIEEE Computer Graphics and Applications, 1990
- Building surfaces of evolution: The Weaving WallInternational Journal of Computer Vision, 1989
- ReACM SIGGRAPH Computer Graphics, 1988