The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2012 vol.18)
pp: 146-159
Harish Doraiswamy , Indian Institute of Science, Bangalore
Vijay Natarajan , Indian Institute of Science, Bangalore
ABSTRACT
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds or non-manifolds in any dimension. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Critical points correspond to nodes in the Reeb graph. Arcs connecting the nodes are computed in the second step by a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The paper also describes a scheme for controlled simplification of the Reeb graph and two different graph layout schemes that help in the effective presentation of Reeb graphs for visual analysis of scalar fields. Finally, the Reeb graph is employed in four different applications—surface segmentation, spatially-aware transfer function design, visualization of interval volumes, and interactive exploration of time-varying data.
INDEX TERMS
Computational topology, scalar functions, Reeb graphs, level set topology, simplification, graph layout.
CITATION
Harish Doraiswamy, Vijay Natarajan, "Output-Sensitive Construction of Reeb Graphs", IEEE Transactions on Visualization & Computer Graphics, vol.18, no. 1, pp. 146-159, January 2012, doi:10.1109/TVCG.2011.37
REFERENCES
[1] Y. Shinagawa, T.L. Kunii, and Y.L. Kergosien, “Surface Coding Based on Morse Theory,” IEEE Computer Graphics Applications, vol. 11, no. 5, pp. 66-78, Sept. 1991.
[2] H.S.Y. Shinagawa, T.L. Kunii, and M. Ibusuki, “Modeling Contact of Two Complex Objects: With an Application to Characterizing Dental Articulations,” Computers and Graphics, vol. 19, no. 1, pp. 21-28, 1995.
[3] S. Takahashi, Y. Shinagawa, and T.L. Kunii, “A Feature-Based Approach for Smooth Surfaces,” Proc. Fourth ACM Symp. Solid Modeling and Applications (SMA '97), pp. 97-110, 1997.
[4] F. Lazarus and A. Verroust, “Level Set Diagrams of Polyhedral Objects,” Proc. Fifth ACM Symp. Solid Modeling and Applications (SMA '99), pp. 130-140, 1999.
[5] M. Hilaga, Y. Shinagawa, T. Kohmura, and T.L. Kunii, “Topology Matching for Fully Automatic Similarity Estimation of 3d Shapes,” Proc. ACM SIGGRAPH, pp. 203-212, 2001.
[6] I. Guskov and Z. Wood, “Topological Noise Removal,” Proc. Graphics Interface, pp. 19-26, 2001.
[7] Z. Wood, H. Hoppe, M. Desbrun, and P. Schröder, “Removing Excess Topology from Isosurfaces,” ACM Trans. Graphics, vol. 23, no. 2, pp. 190-208, 2004.
[8] S. Takahashi, G.M. Nielson, Y. Takeshima, and I. Fujishiro, “Topological Volume Skeletonization Using Adaptive Tetrahedralization,” Proc. Geometric Modeling and Processing (GMP '04), p. 227, 2004.
[9] M. Mortara and G. Patané, “Affine-Invariant Skeleton of 3d Shapes,” Proc. Shape Modeling Int'l (SMI '02), p. 245, 2002.
[10] F. Hétroy and D. Attali, “Topological Quadrangulations of Closed Triangulated Surfaces Using the Reeb Graph,” Graphical Models, vol. 65, nos. 1-3, pp. 131-148, 2003.
[11] E. Zhang, K. Mischaikow, and G. Turk, “Feature-Based Surface Parameterization and Texture Mapping,” ACM Trans. Graphics, vol. 24, no. 1, pp. 1-27, 2005.
[12] M. van Kreveld, R. van Oostrum, C. Bajaj, V. Pascucci, and D.R. Schikore, “Contour Trees and Small Seed Sets for Isosurface Traversal,” Proc. Symp. Computational Geometry, pp. 212-220, 1997.
[13] C.L. Bajaj, V. Pascucci, and D.R. Schikore, “The Contour Spectrum,” Proc. IEEE Conf. Visualization, pp. 167-173, 1997.
[14] H. Carr, J. Snoeyink, and M. van de Panne, “Simplifying Flexible Isosurfaces Using Local Geometric Measures,” Proc. IEEE Conf. Visualization, pp. 497-504, 2004.
[15] I. Fujishiro, Y. Takeshima, T. Azuma, and S. Takahashi, “Volume Data Mining Using 3d Field Topology Analysis,” IEEE Computer Graphics and Applications, vol. 20, no. 5, pp. 46-51, Sept./Oct. 2000.
[16] S. Takahashi, Y. Takeshima, and I. Fujishiro, “Topological Volume Skeletonization and Its Application to Transfer Function Design,” Graphical Models, vol. 66, no. 1, pp. 24-49, 2004.
[17] G.H. Weber, S.E. Dillard, H. Carr, V. Pascucci, and B. Hamann, “Topology-Controlled Volume Rendering,” IEEE Trans. Visualization Computer Graphics, vol. 13, no. 2, pp. 330-341, Nov./Dec. 2007.
[18] J. Zhou and M. Takatsuka, “Automatic Transfer Function Generation Using Contour Tree Controlled Residue Flow Model and Color Harmonics,” IEEE Trans. Visualization and Computer Graphics, vol. 15, no. 6, pp. 1481-1488, Nov. 2009.
[19] Y. Shinagawa and T.L. Kunii, “Constructing a Reeb Graph Automatically from Cross Sections,” IEEE Computer Graphics Application, vol. 11, no. 6, pp. 44-51, Nov. 1991.
[20] K. Cole-McLaughlin, H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci, “Loops in Reeb Graphs of 2-Manifolds,” Discrete Computational Geometry, vol. 32, no. 2, pp. 231-244, 2004.
[21] G. Patanè, M. Spagnuolo, and B. Falcidieno, “A Minimal Contouring Approach to the Computation of the Reeb Graph,” IEEE Trans. Visualization and Computer Graphics, vol. 15, no. 4, pp. 583-595, July/Aug. 2009.
[22] H. Doraiswamy and V. Natarajan, “Efficient Algorithms for Computing Reeb Graphs,” Computational Geometry Theory Applications, vol. 42, nos. 6/7, pp. 606-616, 2009.
[23] H. Carr, J. Snoeyink, and U. Axen, “Computing Contour Trees in All Dimensions,” Computer Geometry Theory Applications, vol. 24, no. 2, pp. 75-94, 2003.
[24] Y.-J. Chiang, T. Lenz, X. Lu, and G. Rote, “Simple and Optimal Output-Sensitive Construction of Contour Trees Using Monotone Paths,” Computer Geometry Theory Applications, vol. 30, no. 2, pp. 165-195, 2005.
[25] J. Tierny, A. Gyulassy, E. Simon, and V. Pascucci, “Loop Surgery for Volumetric Meshes: Reeb Graphs Reduced to Contour Trees,” IEEE Trans. Visualization and Computer Graphics, vol. 15, no. 6, pp. 1177-1184, Nov./Dec. 2009.
[26] V. Pascucci, G. Scorzelli, P.-T. Bremer, and A. Mascarenhas, “Robust Online Computation of Reeb Graphs: Simplicity and Speed,” ACM Trans. Graphics, vol. 26, no. 3, p. 58, 2007.
[27] T. Tung and F. Schmitt, “Augmented Reeb Graphs for Content-Based Retrieval of 3d Mesh Models,” Proc. Shape Modeling Int'l (SMI '04), pp. 157-166, 2004.
[28] H. Doraiswamy and V. Natarajan, “Efficient Output-Sensitive Construction of Reeb Graphs,” Proc. Int'l Symp. Algorithms and Computation, pp. 557-568, 2008.
[29] P.K. Agarwal, H. Edelsbrunner, J. Harer, and Y. Wang, “Extreme Elevation on a 2-Manifold,” Discrete Computational Geometry, vol. 36, no. 4, pp. 553-572, 2006.
[30] H. Edelsbrunner, Geometry and Topology for Mesh Generation. Cambridge Univ. Press, 2001.
[31] T.F. Banchoff, “Critical Points and Curvature for Embedded Polyhedral Surfaces,” Am. Math. Monthly, vol. 77, pp. 475-485, 1970.
[32] H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci, “Morse-Smale Complexes for Piecewise Linear 3-Manifolds,” Proc. Symp. Computational Geometry, pp. 361-370, 2003.
[33] Y. Matsumoto, An Introduction to Morse Theory. Am. Math. Soc., 2002.
[34] G. Reeb, “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, vol. 222, pp. 847-849, 1946.
[35] V. Pascucci and K. Cole-McLaughlin, “Efficient Computation of the Topology of Level Sets,” Proc. IEEE Conf. Visualization, pp. 187-194, 2002.
[36] E.P. Mücke, “Shapes and Implementations in Three-Dimensional Geometry,” PhD dissertation, Dept. of Computer Science, Univ. of Illi nois, 1993.
[37] H. Edelsbrunner, D. Letscher, and A. Zomorodian, “Topological Persistence and Simplification,” Discrete Computational Geometry, vol. 28, no. 4, pp. 511-533, 2002.
[38] V. Pascucci, K. Cole-McLaughlin, and G. Scorzelli, “The TOPORRERY: Computation and Presentation of Multi-Resolution Topology,” Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration, pp. 19-40, Springer, 2009.
[39] I. Fujishiro, Y. Maeda, and H. Sato, “Interval Volume: A Solid Fitting Technique for Volumetric Data Display and Analysis,” Proc. Sixth Conf. Visualization '95 (VIS '95), p. 151, 1995.
[40] B. Guo, “Interval Set: A Volume Rendering Technique Generalizing Isosurface Extraction,” Proc. Sixth Conf. Visualization '95 (VIS '95), p. 3, 1995.
[41] B.-S. Sohn, “Topology Preserving Tetrahedral Decomposition of Trilinear Cell,” Proc. Seventh Int'l Conf. Computational Science, Part I (ICCS '07), pp. 350-357, 2007.
[42] Volvis Repository, http:/www.volvis.org/, 2011.
[43] Tetview Softwarem, http://tetgen.berlios.detetview.html/, 2011.
[44] Aim@shape Shape Repository, http:/www.aimatshape.net/, 2011.
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool