Polygonization of multi-component non-manifold implicit surfaces through a symbolic-numerical continuation algorithm

ABSTRACT

In computer graphics, most algorithms for sampling implicit surfaces use a 2-points numerical method. If the surface-describing function evaluates positive at the first point and negative at the second one, we can say that the surface is located somewhere between them. Surfaces detected this way are called sign-variant implicit surfaces. However, 2-points numerical methods may fail to detect and sample the surface because the functions of many implicit surfaces evaluate either positive or negative everywhere around them. These surfaces are here called sign-invariant implicit surfaces. In this paper, instead of using a 2-points numerical method, we use a 1-point numerical method to guarantee that our algorithm detects and samples both sign-variant and sign-invariant surface components or branches correctly. This algorithm follows a continuation approach to tessellate implicit surfaces, so that it applies symbolic factorization to decompose the function expression into symbolic components, sampling then each symbolic function component separately. This ensures that our algorithm detects, samples, and triangulates most components of implicit surfaces.

References

1. Allgower, E., and Gnutzmann, S. 1987. An algorithm for piecewise linear approximation of implicitly defined two-dimensional surfaces. SIAM Journal on Numerical Analysis 24, 2, 452--469.
2. Allgower, E., and Schmidt, P. 1985. An algorithm for piecewise linear approximation of an implicitly defined manifold. SIAM Journal on Numerical Analysis 22, 2, 322--346.
3. Bloomenthal, J. 1988. Polygonization of implicit surfaces. Computer Aided Geometric Design 4, 5, 341--355.
4. Bloomenthal, J. 1997. Introduction to Implicit Surfaces. Morgan Kaufmann Publishers Inc.
5. Brodzik, M. 1998. he computation of simplicial approximations of implicitly defined p-manifolds. Computers and Mathematics with Applications 36, 6, 389--423.
6. Dobkin, D., Levy, S., Thurston, W., and Wilks, A. 1990. Contour tracing by piecewise linear approximations. ACM Transactions on Graphics 9, 4, 389--423.
7. Gonzalez-Vega, L., and Necula, I. 2002. Efficient topology determination of implicitly defined algebraic plane curves. Computer Aided Geometric Design 19, 9 (December), 719--743.
8. Hall, M., and Warren, J. 1990. Adaptive polygonization of implicitly defined surfaces. IEEE Computer Graphics and Applications 10, 6, 33--42.
9. Hartmann, E. 1998. A marching method for the triangulation of surfaces. The Visual Computer 14, 3, 95--108.
10. Henderson, M. 1993. Computing implicitly defined surfaces: Two parameter continuation. IBM Research Research Report RC18777, IBM Research Division, T. J. Watson Research Center, Yorktown Heights, New York, USA.
11. Henderson, M. 2002. Multiple parameter continuation: computing implicitly defined k-manifolds. International Journal of Bifurcation and Chaos 12, 3, 451--476.
12. Karkanis, T., and Stewart, A. 2001. Curvature-dependent triangulation of implicit surfaces. IEEE Computer Graphics and Applications 22, 2 (March/April), 60--69.
13. Li, Q., Wills, D., Phillips, R., Viant, W., Griffiths, J., and Ward, J. 2004. Implicit fitting using radial basis functions with ellipsoid constraint. Computer Graphics Forum 23, 1.
14. Lorensen, W., and Cline, H. 1987. Marching cubes: A high resolution 3-d surface construction algorithms. Computer Graphics 21, 4, 163--169.
15. Melville, R., and Mackey, D. 1995. New algorithm for two-dimensional numerical continuation. Computers and Mathematics with Applications 30, 1, 31--46.
16. Möller, T. 1997. A fast triangle-triangle intersection test. Journal of Graphics Tools 2, 2, 25--30.
17. Mourrain, B., and Técourt, J.-P. 2005. Computing the topology of real algebraic surface. In MEGA Electronic Proceedings.
18. Muller, H., and Stark, M. 1993. Adaptive generation of surfaces in volume data. The Visual Computer 4, 9, 182--199.
19. Rheinboldt, W., and Burkardt, J. 1983. A locally parameterized continuation process. ACM Transactions on Mathematical Software 9, 236--246.
20. Rheinboldt, W. 1987. On a moving frame algorithm and the triangulation of equilibirum manifolds. In ISNM79: Bifurcation: Analysis, Algorithms, Applications, T. Kuper, R. Seydel, and H. Troger, Eds., 256--267.
21. Rheinboldt, W. 1988. On the computation of multi-dimensional solution manifolds of parameterized equations. Numerische Mathematik 53, 165--182.
22. Schmitt, F., Barsky, B., and Du, W. 1986. An adaptive subdivision method for surface-fitting from sampled data. Computer Graphics 20, 4 (July), 179--188.
23. Seidel, R., and Wolpert, N. 2005. On the exact computation of the topology of real algebraic curves. In Proceedings of the 21st ACM Symposium on Computational Geometry, ACM Press, 107--115.
24. Stander, B., and Hart, J. 1997. Guaranteeing the topology of an implicit surface polygonization for interactive modeling. Computer Graphics 31, 3 (August), 279--286.
25. Velho, L., Figueiredo, L., and Gomes, J. 1999. A unified approach for hierarchical adaptive tesselation of surfaces. ACM Transactions on Graphics 18, 4, 329--360.
26. Zhou, J., N. Patrikalakis, Tuohy, S., and Ye, X. 1997. Scattered data fitting with simplex splines in two and three dimensional spaces. The Visual Computer 13, 7, 295--315.

Index Terms

• Computing methodologies

  • Computer graphics

    • Shape modeling

      • Parametric curve and surface models

      • Volumetric models