This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Curvature-Dependent Triangulation of Implicit Surfaces
March/April 2001 (vol. 21 no. 2)
pp. 60-69
This article describes an algorithm to generate a triangulation of an implicit surface. The generated triangles are close to equilateral and the triangle edge lengths vary with local surface curvature (the user may choose the ratio of edge length to surface curvature). The output of this algorithm is useful for applications that require high-quality triangulations, such as medical imaging, molecular modeling, computer aided design, and finite element analysis. Triangles are "grown" on the surface outward from a seed triangle. After the growing stops, the remaining gap in the triangulation is filled by a set of heuristics. Experiments show that the algorithm consistently builds high-quality triangulations, which compare favorably to those produced by cell-based and particle-based algorithms.

1. N. Max, "Computer Representation of Molecular Surfaces," IEEE Computer Graphics and Applications, vol. 3, no. 7, Aug. 1983, pp. 21-29.
2. J. Bloomenthal, “Polygonization of Implicit Surfaces,” Computer Aided Geometric Design, vol. 5, no. 4, pp. 341-355, 1988.
3. D. Meagher, "Geometric Modeling Using Octree Encoding," Computer Graphics and Image Processing, vol. 19, no. 2, June 1982, pp. 129-147.
4. A.P. Witkin and P.S. Heckbert, "Using Particles to Sample and Control Implicit Surfaces," Computer Graphics(Proc. Siggraph 94), vol. 28, no. 2, 1994, pp. 269-277.
5. B.T. Stander and J.C. Hart, "Guaranteeing the Topology of an Implicit Surface Polygonization for Interactive Modeling," Computer Graphics(Proc. Siggraph 97), vol. 31, no. 2, 1997, pp. 279-286.
1. J. Bloomenthal et al., Introduction to Implicit Surfaces, J. Bloomenthal, ed., Morgan Kaufmann, San Francisco, 1997.
2. E.L. Allgower and P.H. Schmidt, "An Algorithm for Piecewise-Linear Approximation of an Implicitly Defined Manifold," Soc. for Industrial and Applied Math. J. Numerical Analysis, vol. 22, no. 2, Apr. 1985, pp. 322-346.
3. J. Bloomenthal, “Polygonization of Implicit Surfaces,” Computer Aided Geometric Design, vol. 5, no. 4, pp. 341-355, 1988.
4. B. Crespin, P. Guitton, and C. Schlick, "Efficient and Accurate Tessellation of Implicit Sweeps," Proc. Conf. Constructive Solid Geometry, Apr. 1998.
5. G. Wyvill, C. McPheeters, and B. Wyvill, "Data Structure for Soft Objects," The Visual Computer, vol. 2, no. 4, 1986, pp. 227-234.
6. H. Muller and M. Stark, "Adaptive Generation of Surfaces in Volume Data," The Visual Computer, vol. 9, no. 4, 1993, pp. 182-199.
7. L.H. de Figueiredo et al., "Physically Based Methods for Polygonization of Implicit Surfaces," Proc. Conf. Graphics Interface, 1992, pp. 250-257.
8. W.J. Schroeder, J.A. Zarge, and W.E. Lorensen, “Decimation of Triangle Meshes,” Proc. SIGGRAPH '92, pp. 65-70, 1992.
9. G. Turk, "Retiling Polygonal Surfaces," Computer Graphics(Proc. Siggraph 92), vol. 26, no. 2, 1992, pp. 55-64.
10. W. Rheinboldt, "On the Computation of Multi-Dimensional Solution Manifolds of Parameterized Equations," Numerische Mathematik, vol. 53, 1988, pp. 165-182.
11. M. Henderson, Computing Implicitly Defined Surfaces: Two Parameter Continuation, tech. report RC 18777, IBM T.J. Watson Research Center, Yorktown Heights, N.Y., Mar. 1993.
12. M. Henderson, Multiple Parameter Continuation: Computing Implicitly Defined k-Manifolds, tech. report, IBM T.J. Watson Research Center, Feb. 2000, http://www.research.ibm.com/people/h/henderson/ MultiParmContinuation.html.
13. A. Hilton et al., "Marching Triangles: Range Image Fusion for Complex Object Modelling," Proc. Int'l Conf. Image Processing, IEEE Computer Soc. Press, Los Alamitos, Calif., 1996.
14. E. Hartmann, "A Marching Method for the Triangulation of Surfaces," The Visual Computer, vol. 14, no. 3, 1998, pp. 95-108.
15. W.E. Lorensen and H.E. Cline, “Marching Cubes: A High Resolution 3D Surface Construction Algorithm,” Computer Graphics (SIGGRAPH '87 Proc.), vol. 21, pp. 163-169, 1987.
16. R. Szeliski and D. Tonnesen, "Surface Modelling with Oriented Particle Systems," Computer Graphics(Proc. Siggraph 92), vol. 26, no. 2, 1992, pp. 185-194.
17. A.P. Witkin and P.S. Heckbert, "Using Particles to Sample and Control Implicit Surfaces," Computer Graphics(Proc. Siggraph 94), vol. 28, no. 2, 1994, pp. 269-277.
18. M. Desbrun, N. Tsingos, and M.-P. Gascuel, "Adaptive Sampling of Implicit Surfaces for Interactive Modelling and Animation," Computer Graphics Forum, vol. 15, no. 5, 1996, pp. 319-325.
19. H. Edelsbrunner and D.P. Mücke, “Three-Dimensional Alpha Shapes,” ACM Trans, Graphics, vol. 13, pp. 43-72, 1994.
20. A. Bottino, W. Nuij, and K. van Overveld, "How to Shrinkwrap through a Critical Point: An Algorithm for the Adaptive Triangulation of Iso-Surfaces with Arbitrary Topology," Proc. Conf. Implicit Surfaces, 1997, pp. 53-72
21. C.W.A.M. van Overveld and B. Wywill, Shrinkwrap: An Adaptive Algorithm for Polygonizing an Implicit Surface, tech. report 93-514-19, Univ. of Calgary, Canada, Mar. 1993.

Index Terms:
Implicit surface, adaptive triangulation
Citation:
Tasso Karkanis, A. James Stewart, "Curvature-Dependent Triangulation of Implicit Surfaces," IEEE Computer Graphics and Applications, vol. 21, no. 2, pp. 60-69, March-April 2001, doi:10.1109/38.909016
Usage of this product signifies your acceptance of the Terms of Use.