This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Rendering the Intersections of Implicit Surfaces
September/October 2003 (vol. 23 no. 5)
pp. 70-77
Kevin G. Suffern, University of Technology, Sydney
Ronald J. Balsys, Central Queensland University

The article presents algorithms for rendering the intersection curves of implicit surfaces. The algorithms use octree-based recursive space subdivision techniques, within a viewing cube specified by the user. The subdivision process employs interval techniques to increase the algorithms' robustness. Applications for these algorithms include rendering the intersection curves of two surfaces, aiding the visualization of individual surfaces, plotting contour lines and rendering contour maps of functions defined on implicit surfaces, and trimming one implicit surface against another. Examples of functions whose contour lines can be plotted by the techniques described are various planar contours, and the Gaussian and mean curvatures of implicit surfaces.

1. J. Bloomenthal, “Polygonization of Implicit Surfaces,” Computer Aided Geometric Design, vol. 5, no. 4, pp. 341-355, 1988.
2. R.J. Balsys and K.G. Suffern, "Visualisation of Implicit Surfaces," Computers&Graphics, vol. 25, no. 1, 2001, pp. 89-107.
3. R.E. Moore, Interval Analysis, Prentice-Hall, Englewood Cliffs, 1966.
4. K.G. Suffern and E.D. Fackerell, "Interval Methods in Computer Graphics," Computers&Graphics, vol. 15, no. 3, 1991, pp. 331-340.
5. K.G. Suffern, "The Apparent Shape of a Rapidly Moving Sphere," American J. of Physics, vol. 56, no. 8, 1988, pp. 729-733.
6. J.M.A. Danby, Fundamentals of Celestial Mechanics, MacMillan, 1962.
7. B. Wyvill, A. Guy, and E. Galin, "Extending the CSG Tree—Warping, Blending, and Boolean Operations in an Implicit Surface Modeling System," Computer Graphics Forum, vol. 18, no. 2, 1999, pp. 149-158.
1. J. Bloomenthal, “Polygonization of Implicit Surfaces,” Computer Aided Geometric Design, vol. 5, no. 4, pp. 341-355, 1988.
2. K.G. Suffern and E.D. Fackerell, "Interval Methods in Computer Graphics," Computers&Graphics, vol. 15, no. 3, 1991, pp. 331-340.
3. M.F.W. Schmidt, "Cutting Cubes—Visualizing Implicit Surfaces by Adaptive Polygonization," The Visual Computer, vol. 10, no. 2, 1993, pp. 101-115.
4. L. Velho, "Simple and Efficient Polygonisation of Implicit Surfaces," J. Graphics Tools, vol. 1, no. 2, 1996, pp. 5-24.
5. R.J. Balsys and K.G. Suffern, "Visualisation of Implicit Surfaces," Computers&Graphics, vol. 25, no. 1, 2001, pp. 89-107.
6. J. Bloomenthal, ed. Introduction to Implicit Surfaces, Morgan Kaufmann, 1997.
7. K.C. Hui and Z.H. Jiang,"Tetrahedra Based Adaptive Polygonisation of Implicit Surface Patches," Computer Graphics Forum, vol. 18, no. 1, 1999, pp. 57-68.
8. B. Wyvill, A. Guy, and E. Galin, "Extending the CSG Tree—Warping, Blending, and Boolean Operations in an Implicit Surface Modeling System," Computer Graphics Forum, vol. 18, no. 2, 1999, pp. 149-158.
1. M. Spivak, A Comprehensive Introduction to Differential Geometry, 2nd ed., vol. III, Publish or Perish Inc., 1979, p. 204.

Index Terms:
implicit surfaces, intersections, octrees, intervals, curvature, Boolean operations, contours, contour maps
Citation:
Kevin G. Suffern, Ronald J. Balsys, "Rendering the Intersections of Implicit Surfaces," IEEE Computer Graphics and Applications, vol. 23, no. 5, pp. 70-77, Sept.-Oct. 2003, doi:10.1109/MCG.2003.1231180
Usage of this product signifies your acceptance of the Terms of Use.