Abstract
Hypertextures are a useful modelling tool in that they can add three-dimensional detail to the surface of otherwise smooth objects. Hypertextures can be rendered as implicit surfaces, resulting in objects with a complex but well defined boundary. However, representing a hypertexture as an implicit surface often results in many small parts being detached from the main surface, turning an object into a disconnected set. Depending on the context, this can detract from the realism in a scene, where one usually does not expect a solid object to have clouds of smaller objects floating around it. We present a topology correction technique, integrated in a ray casting algorithm for hypertextured implicit surfaces, that detects and removes all the surface components that have become disconnected from the main surface. Our method works with implicit surfaces that are C2 continuous and uses Morse theory to find the critical points of the surface. The method follows the separatrix lines joining the critical points to isolate disconnected components.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Cook, R.L.: Shade trees. In: Christiansen, H. (ed.) Computer Graphics (SIGGRAPH ’84 Proceedings), vol. 18, pp. 223–231. ACM Press (1984)
de Figueiredo, L.H., Stolfi, J.: Affine arithmetic: Concepts and applications. Numer. Algorithms 37(1–4), 147–158 (2004)
Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3(3), 209–226 (1977)
Gamito, M.N., Maddock, S.C.: Ray casting implicit fractal surfaces with reduced affine arithmetic. Visual Comput. 23(3), 155–165 (2007). A correction has been made to this paper, which is available at http://www.dcs.shef.ac.uk/∼mag/raycast.html
Hart, J.C.: Sphere tracing: A geometric method for the antialiased ray tracing of implicit surfaces. Visual Comput. 12(9), 527–545 (1996)
Hart, J.C.: Morse theory for implicit surface modeling. In: Hege, H.C., Polthier, K. (eds.) Mathematical Visualization, pp. 257–268. Springer, Heidelberg (1998)
Hart, J.C.: Using the CW-complex to represent the topological structure of implicit surfaces and solids. In: Proc. Implicit Surfaces ’99, pp. 107–112. Eurographics/SIGGRAPH (1999)
Hart, J.C., Durr, A., Arsch, D.: Critical points of polynomial metaballs. In: Proc. Implicit Surfaces ’98, pp. 69–76. Eurographics/SIGGRAPH (1998)
Heidrich, W., Seidel, H.P.: Ray-tracing procedural displacement shaders. In: Davis, W., Booth, K., Fournier, A. (eds.) Proceedings of Graphics Interface ’98, pp. 8–16. Canadian Information Processing Society, Morgan Kaufmann Publishers (1998)
Helman, J.L., Hesselink, L.: Visualizing vector field topology in fluid flows. IEEE Comput. Graph. Appl. 11(3), 36–46 (1991)
Hindmarsh, A.C.: ODEPACK: A systematized collection of ODE solvers. In: Stepleman, R.S. (ed.) Scientific Computing, pp. 55–64. North-Holland, Amsterdam (1983). (Package available at www.netlib.org)
Lewis, J.P.: Algorithms for solid noise synthesis. In: Lane, J. (ed.) Comput. Graph. (SIGGRAPH ’89 Proceedings) 23, 263–270 (1989)
Milnor, J.: Morse Theory. Annals of Mathematics Studies, vol. 51. Princeton University Press, Princeton (1963)
Moore, R.: Interval Arithmetic. Prentice-Hall (1966)
Musgrave, F.K.: Mojoworld: Building procedural planets. In: Ebert, D.S., Musgrave, F.K. (eds.) Texturing & Modeling: A Procedural Approach, 3rd edn., chap. 20, pp. 565–615. Morgan Kauffman Publishers Inc. (2003)
Perlin, K.: An image synthesizer. In: Barsky, B.A. (ed.) Comput. Graph. (SIGGRAPH ’85 Proceedings) 19, 287–296 (1985)
Perlin, K.: Improving noise. ACM Trans. Graph. (SIGGRAPH ’02 Proceedings) 21(3), 681–682 (2002)
Perlin, K., Hoffert, E.M.: Hypertexture. In: Lane, J. (ed.) Comput. Graph. (SIGGRAPH ’89 Proceedings), 23, 253–262 (1989)
Saupe, D.: Point evaluation of multi-variable random fractals. In: Jüergens, H., Saupe, D. (eds.) Visualisierung in Mathematik und Naturissenschaften – Bremer Computergraphik Tage, pp. 114–126. Springer (1989)
Sclaroff, S., Pentland, A.: Generalized implicit functions for computer graphics. In: Sederberg, T.W. (ed.) Comput. Graph. (SIGGRAPH ’91 Proceedings) 25, 247–250. (1991)
Shinagawa, Y., Kunii, T.L., Kergosien, Y.L.: Surface coding based on morse theory. IEEE Comput. Graph. Appl. 11(5), 66–78 (1991)
Snyder, J.M.: Interval analysis for computer graphics. In: Catmull, E.E. (ed.) Comput. Graph. (SIGGRAPH ’92 Proceedings) 26, 121–130 (1992)
Sproull, R.F.: Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica 6, 579–589 (1991)
Stander, B.T., Hart, J.C.: Guaranteeing the topology of an implicit surface polygonization for interactive modeling. In: Whitted, T. (ed.) Comput. Graph. (SIGGRAPH ’97 Proceedings) 31, 279–286 (1997)
Wu, S.T., de Gomensoro Malheiros, M.: On improving the search for critical points of implicit functions. In: Proc. Implicit Surfaces ’99, pp. 73–80. Eurographics/SIGGRAPH (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gamito, M., Maddock, S. Topological correction of hypertextured implicit surfaces for ray casting . Visual Comput 24, 397–409 (2008). https://doi.org/10.1007/s00371-008-0221-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00371-008-0221-4