“Guaranteeing the topology of an implicit surface polygonization for interactive modeling” by Stander and Hart

  • ©Barton T. Stander and John C. Hart




    Guaranteeing the topology of an implicit surface polygonization for interactive modeling



    Morse theory shows how the topology of an implicit surface is affected by its function’s critical points, whereas catastrophe theory shows how these critical points behave as the function’s parameters change. Interval analysis finds the critical points, and they can also be tracked efficiently during parameter changes. Changes in the function value at these critical points cause changes in the topology. Techniques for modifying the polygonization to accommodate such changes in topology are given. These techniques are robust enough to guarantee the topology of an implicit surface polygonization, and are efficient enough to maintain this guarantee during interactive modeling. The impact of this work is a topologically-guaranteed polygonization technique, and the ability to directly and accurately manipulate polygonized implicit surfaces in real time.


    1. BLINN, J. F. A generalization of algebraic surface drawing. ACM Transactions on Graphics 1, 3 (July 1982), 235-256.
    2. BLOOMENTHAL, J. Polygonization of implicit surfaces. Computer Aided Geometric Design 5, 4 (Nov. 1988), 341- 355.
    3. BLOOMENTHAL, J., AND WYVILL, B. Interactive techniques for implicit modeling. Computer Graphics 24, 2 (Mar. 1990), 109-116.
    4. BOTTINO, A., NUIJ, W., AND VAN OVERvELD, K. How to shrinkwrap through a critical point: an algorithm for the adaptive triangulation of iso-surfaces with arbitrary topology. In Proc. Implicit Surfaces ’96 (Oct. 1996), pp. 53-72.
    5. CHENG, K.-P. Using plane vector fieldsto obtain all the intersection curves of two general surfaces. In Theory and Practice of Geometric Modeling (New York, 1989), Springer-Verlag.
    6. DE FIGUEIREDO, L. H., DE MIRANDA GOMES, J., TER- ZOPOULOS, D., AND VELHO, L. Physically-based methods for polygonization of implicit surfaces. In Proceedings of Graphics Intelface ’92 (May 1992), pp. 250-257.
    7. DELMARCELLE, T., AND HESSELINK, L. The topology of symmetric, second-order tensor fields. Proceedings IEEE Visualization ’94 (October 1994), 140-147.
    8. DESBRUN, M., TSINGOS, N., AND GASCUEL, M.-P. Adaptive sampling of implicit surfaces for interactive modeling and animation. Implicit Sulfaces ’95 Proceedings (April 1995), 171-185.
    9. FLEISCHER, K. W., LAIDLAW, D. H., CURRIN, B. L., AND B ARR, A. H. Cellular texture generation. In Computer Graphics (Annual Conference Series) (Aug. 1995), pp. 239- 248.
    10. HANSEN, E. A globally convergent interval method for computing and bounding real roots. BIT 18 (1978), 415-424.
    11. HANSEN, E. R., AND GREENBERG, R. I. An interval newton method. Applied Mathematics and Computation 12 (1983), 89-98.
    12. HART, J. C. Morse theory for computer graphics. Tech. Rep. EECS-97-002, Washington State University, May 1997. Also in: SIGGRAPH ’97 Course #14 Notes “New Frontiers in Modeling and Texturing”.
    13. HELMAN, J. L., AND HESSELINK, L. Visualizing vector field topology in fluid flows. IEEE Computer Graphics and Applications (May 1991), 36-46.
    14. KALRA, D., AND BARR, A. H. Guaranteed ray intersections with implicit surfaces. Computer Graphics 23, 3 (July 1989), 297-306.
    15. KERGOSIEN, Y. L. Generic sign systems in medical imaging. IEEE Computer Graphics and Applications 11, 5 (Sep. 1991), 46-65.
    16. LORENSEN, W. E., AND CLINE, H. E. Marching cubes: A high resolution 3-d surface construction algorithm. Computer Graphics 21, 4 (July 1987), 163-170.
    17. MITCHELL, D. Three applications of interval analysis in computer graphics. In Frontiers of Rendering. SIGGRAPH ’91 Course Notes, 1991.
    18. MITCHELL, D., AND HANRAHAN, P. Illumination from curved reflectors. Computer Graphics 26, 2 (July 1992), 283- 291.
    19. MOORE, R. E. Interval Analysis. Prentice Hall, 1966.
    20. NING, P., AND BLOOMENTHAL, J. An evaluation of implicit surface tilers. Computer Graphics and Applications 13, 6 (Nov. 1993), 33-41.
    21. NISHIMURA, H., HIRAI, M., KAWAI, T., KAWATA, T., SHI- RAKAWA, I., AND OMURA, K. Object modeling by distribution function and a method of image generation. In Proc. of Electronics Communication Conference ‘ 85 (1985), pp. 718- 725. (Japanese).
    22. NORTON, A. Generation and rendering of geometric fractals in 3-D. Computer Graphics 16, 3 (1982), 61-67.
    23. RATScHEK, n., AND ROKNE, J. Computer Methods for the Range of Functions. John Wiley and Sons, 1984.
    24. RODRIAN, H.-C., AND MOOCK, H. Dynamic triangulation of animated skeleton-based implicit surfaces. In Proc. Implicit Sulfaces ’96 (Oct. 1996), pp. 37-52.
    25. ROSCH, A., RUHL, M., AND S AUPE, D. Interactive visualization of implicit surfaces with singularities. In Proc. Implicit Surfaces ’96 (Oct. 1996), pp. 73-87.
    26. SEDERBERG, T. W., AND GREENWOOD, E. A physically based approach to 2-D shape blending. Computer Graphics 26, 2 (July 1992), 25-34.
    27. SHINAGAWA, Y., KUNII, T. L., AND KERGOSIEN, Y. L. Surface coding based on morse theory. IEEE Computer Graphics and Applications 11, 5 (Sep. 1991), 66-78.
    28. SNYDER, J. Generative Modeling for Computer Graphics and CAD. Academic Press, 1992.
    29. STANDER, B. T. Polygonizing Implicit Sulfaces with Guaranteed Topology. PhD thesis, School of EECS, Washington State University, May 1997.
    30. SUFFERN, K., AND FACKERELL, E. Interval methods in computer graphics. In Proc. AUSGRAPH 90 (1990), pp. 35- 44.
    31. SZELISKI, R., AND TONNESEN, D. Surface modeling with oriented particle systems. In Computer Graphics (SIG- GRAPH ’92 Proceedings) (July 1992), E. E. Catmull, Ed., vol. 26, pp. 185-194.
    32. TAYLOR, A. E. Advanced Calculus. Ginn and Company, 1955.
    33. TURK, G. Generating textures for arbitrary surfaces using reaction-diffusion. In Computer Graphics (SIGGRAPH ’91 Proceedings) (July 1991), T. W. Sederberg, Ed., vol. 25, pp. 289-298.
    34. VAN OVERVELD, C., AND WYVILL, B. Shrinkwrap: an adaptive algorithm for polygonizing and implicit surface. Tech. Rep. 93/514/19, University of Calgary, Dept. of Computer Science, March 1993.
    35. WITKIN, A. P., AND HECKBERT, P. S. Using particles to sample and control implicit surfaces. In Computer Graphics (Annual Conference Series) (July 1994), pp. 269-278.
    36. WYVILL, G., MCPHEETERS, C., AND WYVILL, B. Data structure for soft objects. Visual Computer 2, 4 (1986), 227- 234.

ACM Digital Library Publication:

Overview Page: