Simple and Efficient Polygonization of Implicit Surfaces
- 1 January 1996
- journal article
- research article
- Published by Taylor & Francis in Journal of Graphics Tools
- Vol. 1 (2), 5-24
- https://doi.org/10.1080/10867651.1996.10487456
Abstract
This paper describes a simple and efficient polygonization algorithm that gives a practical way to construct adapted piecewise linear representations of implicit surfaces. The method starts with a coarse uniform polygonal approximation of the surface and subdivides each polygon recursively according to local curvature. In this way, the inherent complexity of the problem is tamed by separating structuring from sampling and reducing part of the full three-dimensional search to two dimensions.Keywords
This publication has 15 references indexed in Scilit:
- Computational morphology of curvesThe Visual Computer, 1994
- Decimation of triangle meshesACM SIGGRAPH Computer Graphics, 1992
- Collision detection by four-dimensional intersection testingIEEE Transactions on Robotics and Automation, 1990
- HypertextureACM SIGGRAPH Computer Graphics, 1989
- Polygonization of implicit surfacesComputer Aided Geometric Design, 1988
- Marching cubes: A high resolution 3D surface construction algorithmACM SIGGRAPH Computer Graphics, 1987
- Data structure forsoft objectsThe Visual Computer, 1986
- A Generalization of Algebraic Surface DrawingACM Transactions on Graphics, 1982
- Ray casting for modeling solidsComputer Graphics and Image Processing, 1982
- Representations for Rigid Solids: Theory, Methods, and SystemsACM Computing Surveys, 1980