The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - Feb. (2013 vol.19)
pp: 249-262
H. Doraiswamy , Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India
V. Natarajan , Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India
ABSTRACT
The Reeb graph of a scalar function tracks the evolution of the topology of its level sets. This paper describes a fast algorithm to compute the Reeb graph of a piecewise-linear (PL) function defined over manifolds and non-manifolds. The key idea in the proposed approach is to maximally leverage the efficient contour tree algorithm to compute the Reeb graph. The algorithm proceeds by dividing the input into a set of subvolumes that have loop-free Reeb graphs using the join tree of the scalar function and computes the Reeb graph by combining the contour trees of all the subvolumes. Since the key ingredient of this method is a series of union-find operations, the algorithm is fast in practice. Experimental results demonstrate that it outperforms current generic algorithms by a factor of up to two orders of magnitude, and has a performance on par with algorithms that are catered to restricted classes of input. The algorithm also extends to handle large data that do not fit in memory.
INDEX TERMS
trees (mathematics), data handling, piecewise linear techniques, set theory, large data handling, contour tree union, scalar function, topology evolution, level set, piecewise-linear function, nonmanifold, efficient contour tree algorithm, loop-free Reeb graph, join tree, union-find operation, generic algorithm, Level set, Vegetation, Memory management, Topology, Manifolds, Algorithm design and analysis, Complexity theory, out-of-core algorithm, Computational topology, scalar functions, Reeb graphs, level set topology
CITATION
H. Doraiswamy, V. Natarajan, "Computing Reeb Graphs as a Union of Contour Trees", IEEE Transactions on Visualization & Computer Graphics, vol.19, no. 2, pp. 249-262, Feb. 2013, doi:10.1109/TVCG.2012.115
REFERENCES
[1] F. Lazarus and A. Verroust, "Level Set Diagrams of Polyhedral Objects," Proc. ACM Symp. Solid Modeling and Applications, pp. 130-140, 1999.
[2] Y. Shinagawa, T.L. Kunii, and Y.L. Kergosien, "Surface Coding Based on Morse Theory," IEEE Computer Graphics and Applications, vol. 11, no. 5, pp. 66-78, Sept. 1991.
[3] S. Takahashi, Y. Shinagawa, and T.L. Kunii, "A Feature-Based Approach for Smooth Surfaces," Proc. Symp. Solid Modeling and Applications, pp. 97-110, 1997.
[4] 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.
[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] Y.-J. Chiang and X. Lu, "Progressive Simplification of Tetrahedral Meshes Preserving all Isosurface Topologies," Computer Graphics Forum, vol. 22, no. 3, pp. 493-504, 2003.
[8] S. Takahashi, G.M. Nielson, Y. Takeshima, and I. Fujishiro, "Topological Volume Skeletonization Using Adaptive Tetrahedralization," Proc. Geometric Modeling and Processing, pp. 227-236, 2004.
[9] 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.
[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] M. Mortara and G. Patané, "Affine-Invariant Skeleton of 3D Shapes," Proc. Shape Modeling Int'l, pp. 245, 2002.
[12] 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.
[13] M. van Kreveld, R. van Oostrum, C. Bajaj, V. Pascucci, and D.R. Schikore, "Contour Trees and Small Seed Sets for Isosurface Traversal," Proc. 13th Ann. Symp. Computational Geometry, pp. 212-220, 1997.
[14] C.L. Bajaj, V. Pascucci, and D.R. Schikore, "The Contour Spectrum," Proc. IEEE Conf. Visualization, pp. 167-173, 1997.
[15] H. Carr, J. Snoeyink, and M. van de Panne, "Simplifying Flexible Isosurfaces Using Local Geometric Measures," Proc. IEEE Conf. Visualization, pp. 497-504, 2004.
[16] 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.
[17] 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.
[18] G.H. Weber, S.E. Dillard, H. Carr, V. Pascucci, and B. Hamann, "Topology-Controlled Volume Rendering," IEEE Trans. Visualization and Computer Graphics, vol. 13, no. 2, pp. 330-341, Mar./Apr. 2007.
[19] J. Zhou and M. Takatsuka, "Automatic Transfer Function Generation Using Contour Tree Controlled Residue Flow Model and Color Harmonics," IEEE Trans. Visualization Computer Graphics, vol. 15, no. 6, pp. 1481-1488, 2009.
[20] W. Harvey and Y. Wang, "Topological Landscape Ensembles for Visualization of Scalar-Valued Functions," Computer Graphics Forum, vol. 29, pp. 993-1002, 2010.
[21] P. Oesterling, C. Heine, H. Jänicke, G. Scheuermann, and G. Heyer, "Visualization of High Dimensional Point Clouds Using Their Density Distribution's Topology," IEEE Trans. Visualization and Computer Graphics, vol. 17, no. 11, pp. 1547-1559, Nov. 2011.
[22] S. Biasotti, D. Giorgi, M. Spagnuolo, and B. Falcidieno, "Reeb Graphs for Shape Analysis and Applications," Theoretical Computer Science, vol. 392, pp. 5-22, Feb. 2008.
[23] S. Biasotti, L. De Floriani, B. Falcidieno, P. Frosini, D. Giorgi, C. Landi, L. Papaleo, and M. Spagnuolo, "Describing Shapes by Geometrical-Topological Properties of Real Functions," ACM Computing Surveys, vol. 40, pp. 12:1-12:87, Oct. 2008.
[24] S. Biasotti, L. Floriani, B. Falcidieno, and L. Papaleo, "Morphological Representations of Scalar Fields," Shape Analysis and Structuring, Mathematics and Visualization, L. Floriani, M. Spagnuolo, G. Farin, H.-C. Hege, D. Hoffman, C.R. Johnson, and K. Polthier, eds., pp. 185-213, Springer, 2008.
[25] S. Biasotti, D. Attali, J.-D. Boissonnat, H. Edelsbrunner, G. Elber, M. Mortara, G.S. Baja, M. Spagnuolo, M. Tanase, and R. Veltkamp, "Skeletal Structures," Shape Analysis and Structuring, Mathematics and Visualization, L. Floriani, M. Spagnuolo, G. Farin, H.-C. Hege, D. Hoffman, C.R. Johnson, and K. Polthier, eds., pp. 145-183, Springer, 2008.
[26] H. Carr, J. Snoeyink, and U. Axen, "Computing Contour Trees in all Dimensions," Computational Geometry: Theory and Application, vol. 24, no. 2, pp. 75-94, 2003.
[27] K. Cole-McLaughlin, H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci, "Loops in Reeb Graphs of 2-Manifolds," Discrete and Computational Geometry, vol. 32, no. 2, pp. 231-244, 2004.
[28] H. Doraiswamy and V. Natarajan, "Efficient Algorithms for Computing Reeb Graphs," Computational Geometry: Theory and Applications, vol. 42, nos. 6/7, pp. 606-616, 2009.
[29] V. Pascucci, G. Scorzelli, P.-T. Bremer, and A. Mascarenhas, "Robust On-Line Computation of Reeb Graphs: Simplicity and Speed," ACM Trans. Graphics, vol. 26, no. 3,article 58, 2007.
[30] W. Harvey, Y. Wang, and R. Wenger, "A Randomized O(m log m) Time Algorithm for Computing Reeb Graphs of Arbitrary Simplicial Complexes," Proc. Symp. Computational geometry, pp. 267-276, 2010.
[31] 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.
[32] H. Doraiswamy and V. Natarajan, "Output-Sensitive Construction of Reeb Graphs," IEEE Trans. Visualization and Computer Graphics, vol. 18, no. 1, pp. 146-159, Jan. 2012.
[33] 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.
[34] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press, 2001.
[35] Y.-J. Chiang, T. Lenz, X. Lu, and G. Rote, "Simple and Optimal Output-Sensitive Construction of Contour Trees Using Monotone Paths," Computational Geometry: Theory and Application, vol. 30, no. 2, pp. 165-195, 2005.
[36] Y. Shinagawa and T.L. Kunii, "Constructing a Reeb Graph Automatically from Cross Sections," IEEE Computer Graphics and Application, vol. 11, no. 6, pp. 44-51, Nov. 1991.
[37] H. Edelsbrunner and J. Harer, Computational Topology: An Introduction. Am. Math. Soc., 2009.
[38] A. Hatcher, Algebraic Topology. Cambridge Univ. Press, 2002.
[39] J. Milnor, Morse Theory. Princeton Univ. Press, 1963.
[40] T.F. Banchoff, "Critical Points and Curvature for Embedded Polyhedral Surfaces," Am. Math. Monthly, vol. 77, pp. 475-485, 1970.
[41] H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci, "Morse-Smale Complexes for Piecewise Linear 3-Manifolds," Proc. 19th Ann. Symp. Computational Geometry, pp. 361-370, 2003.
[42] Y. Matsumoto, An Introduction to Morse Theory, Am. Math. Soc., 2002.
[43] 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, vol. 222, pp. 847-849, 1946.
[44] H. Edelsbrunner, Geometry and Topology for Mesh Generation. Cambridge Univ. Press, 2001.
[45] R. Diestel, Graph Theory, Graduate Texts in Mathematics, third ed., vol. 173, Springer-Verlag, 2005.
[46] E.P. Mücke, "Shapes and Implementations in Three-Dimensional Geometry," PhD dissertation, Dept. of Computer Science, Univ. of Illinois, Urbana-Champaign, Illi nois, 1993.
[47] The Digital Michelangelo Project. http://graphics.stanford.edu/projectsmich /, 2012.
39 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool