Abstract
The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. This paper describes a near-optimal two-step algorithm that constructs the Reeb graph of a Morse function defined over manifolds in any dimension. The algorithm first identifies the critical points of the input manifold, and then connects these critical points in the second step to obtain the Reeb graph. A simplification mechanism based on topological persistence aids in the removal of noise and unimportant features. A radial layout scheme results in a feature-directed drawing of the Reeb graph. Experimental results demonstrate the efficiency of the Reeb graph construction in practice and its applications.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Edelsbrunner, H., Harer, J., Wang, Y.: Extreme elevation on a 2-manifold. Disc. Comput. Geom. 36(4), 553–572 (2006)
Bajaj, C.L., Pascucci, V., Schikore, D.R.: The contour spectrum. In: Proc. IEEE Conf. Visualization, pp. 167–173 (1997)
Banchoff, T.F.: Critical points and curvature for embedded polyhedral surfaces. Am. Math. Monthly 77, 475–485 (1970)
Carr, H., Snoeyink, J., Axen, U.: Computing contour trees in all dimensions. Comput. Geom. Theory Appl. 24(2), 75–94 (2003)
Carr, H., Snoeyink, J., van de Panne, M.: Simplifying flexible isosurfaces using local geometric measures. In: Proc. IEEE Conf. Visualization, pp. 497–504 (2004)
Chiang, Y.-J., Lenz, T., Lu, X., Rote, G.: Simple and optimal output-sensitive construction of contour trees using monotone paths. Comput. Geom. Theory Appl. 30(2), 165–195 (2005)
Cole-McLaughlin, K., Edelsbrunner, H., Harer, J., Natarajan, V., Pascucci, V.: Loops in Reeb graphs of 2-manifolds. Disc. Comput. Geom. 32(2), 231–244 (2004)
Edelsbrunner, H.: Geometry and Topology for Mesh Generation. Cambridge Univ. Press, England (2001)
Edelsbrunner, H., Harer, J., Natarajan, V., Pascucci, V.: Morse-Smale complexes for piecewise linear 3-manifolds. In: Proc. Symp. Comput. Geom., pp. 361–370 (2003)
Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. Disc. Comput. Geom. 28(4), 511–533 (2002)
Guskov, I., Wood, Z.: Topological noise removal. In: Proc. Graphics Interface, pp. 19–26 (2001)
Hétroy, F., Attali, D.: Topological quadrangulations of closed triangulated surfaces using the Reeb graph. Graph. Models 65(1-3), 131–148 (2003)
Hilaga, M., Shinagawa, Y., Kohmura, T., Kunii, T.L.: Topology matching for fully automatic similarity estimation of 3d shapes. In: Proc. SIGGRAPH, pp. 203–212 (2001)
Matsumoto, Y.: An Introduction to Morse Theory. Amer. Math. Soc. (2002) (Translated from Japanese by Hudson K., Saito M.)
Mücke, E.P.: Shapes and Implementations in Three-Dimensional Geometry. PhD thesis, Dept. Computer Science, University of Illinois, Urbana-Champaign, Illinois (1993)
Pascucci, V., Cole-McLaughlin, K., Scorzelli, G.: Multi-resolution computation and presentation of contour trees. Tech. rep., Lawrence Livermore Natl. Lab (2005)
Pascucci, V., Scorzelli, G., Bremer, P.-T., Mascarenhas, A.: Robust on-line computation of reeb graphs: simplicity and speed. ACM Trans. Graph. 26(3), 58 (2007)
Reeb, G.: Sur les points singuliers d’une forme de pfaff complètement intégrable ou d’une fonction numérique. Comptes Rendus de L’Académie ses Séances, Paris 222, 847–849 (1946)
Shinagawa, Y., Kunii, T.L.: Constructing a reeb graph automatically from cross sections. IEEE Comput. Graph. Appl. 11(6), 44–51 (1991)
Shinagawa, Y., Kunii, T.L., Kergosien, Y.L.: Surface coding based on Morse theory. IEEE Comput. Graph. Appl. 11(5), 66–78 (1991)
Tung, T., Schmitt, F.: Augmented reeb graphs for content-based retrieval of 3d mesh models. In: SMI 2004: Proc. Shape Modeling Intl., pp. 157–166 (2004)
van Kreveld, M., van Oostrum, R., Bajaj, C., Pascucci, V., Schikore, D.R.: Contour trees and small seed sets for isosurface traversal. In: Proc. Symp. Comput. Geom., pp. 212–220 (1997)
Weber, G.H., Dillard, S.E., Carr, H., Pascucci, V., Hamann, B.: Topology-controlled volume rendering. IEEE Trans. Vis. Comput. Graph. 13(2), 330–341 (2007)
Wood, Z., Hoppe, H., Desbrun, M., Schröder, P.: Removing excess topology from isosurfaces. ACM Trans. Graph. 23(2), 190–208 (2004)
Shinagawa, Y., Kunii, T.L., Sato, H., Ibusuki, M.: Modeling contact of two complex objects: with an application to characterizing dental articulations. Computers and Graphics 19(1), 21–28 (1995)
Zhang, E., Mischaikow, K., Turk, G.: Feature-based surface parameterization and texture mapping. ACM Trans. Graph. 24(1), 1–27 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doraiswamy, H., Natarajan, V. (2008). Efficient Output-Sensitive Construction of Reeb Graphs. In: Hong, SH., Nagamochi, H., Fukunaga, T. (eds) Algorithms and Computation. ISAAC 2008. Lecture Notes in Computer Science, vol 5369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92182-0_50
Download citation
DOI: https://doi.org/10.1007/978-3-540-92182-0_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92181-3
Online ISBN: 978-3-540-92182-0
eBook Packages: Computer ScienceComputer Science (R0)