Efficient algorithms for computing Reeb graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. We describe an algorithm that constructs the Reeb graph of a Morse function defined on a 3-manifold. Our algorithm maintains connected components of the two dimensional levels sets as a dynamic graph and constructs the Reeb graph in O(nlogn+nlogg(loglogg)^3) time, where n is the number of triangles in the tetrahedral mesh representing the 3-manifold and g is the maximum genus over all level sets of the function. We extend this algorithm to construct Reeb graphs of d-manifolds in O(nlogn(loglogn)^3) time, where n is the number of triangles in the simplicial complex that represents the d-manifold. Our result is a significant improvement over the previously known O(n^2) algorithm. Finally, we present experimental results of our implementation and demonstrate that our algorithm for 3-manifolds performs efficiently in practice.

[1]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[2]  David Eppstein,et al.  Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. , 1993 .

[3]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[4]  Taku Komura,et al.  Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.

[5]  Zoë J. Wood,et al.  Topological Noise Removal , 2001, Graphics Interface.

[6]  Tosiyasu L. Kunii,et al.  Modeling contact of two complex objects, with an application to characterizing dental articulations , 1995, Comput. Graph..

[7]  Tosiyasu L. Kunii,et al.  Constructing a Reeb graph automatically from cross sections , 1991, IEEE Computer Graphics and Applications.

[8]  Robert E. Tarjan,et al.  Biased Search Trees , 1985, SIAM J. Comput..

[9]  Valerio Pascucci,et al.  Parallel Computation of the Topology of Level Sets , 2003, Algorithmica.

[10]  Valerio Pascucci,et al.  The contour spectrum , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[11]  Valerio Pascucci,et al.  Morse-smale complexes for piecewise linear 3-manifolds , 2003, SCG '03.

[12]  T. Banchoff.  Critical Points and Curvature for Embedded Polyhedral Surfaces , 1970 .

[13]  Mathieu Desbrun,et al.  Removing excess topology from isosurfaces , 2004, TOGS.

[14]  David Auber,et al.  Tulip - A Huge Graph Visualization Framework , 2004, Graph Drawing Software.

[15]  David Eppstein,et al.  Dynamic generators of topologically embedded graphs , 2002, SODA '03.

[16]  Bernd Hamann,et al.  Topology-Controlled Volume Rendering , 2006, IEEE Transactions on Visualization and Computer Graphics.

[17]  Franck Hétroy,et al.  Topological quadrangulations of closed triangulated surfaces using the Reeb graph , 2002, Graph. Model..

[18]  Tosiyasu L. Kunii,et al.  Surface coding based on Morse theory , 1991, IEEE Computer Graphics and Applications.

[19]  Jack Snoeyink,et al.  Simplifying flexible isosurfaces using local geometric measures , 2004, IEEE Visualization 2004.

[20]  Valerio Pascucci,et al.  Loops in Reeb Graphs of 2-Manifolds , 2004, Discret. Comput. Geom..

[22]  Valerio Pascucci,et al.  Robust on-line computation of Reeb graphs: simplicity and speed , 2007, SIGGRAPH 2007.

[23]  Mikkel Thorup,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 1998, STOC '98.

[24]  Tony Tung,et al.  Augmented Reeb graphs for content-based retrieval of 3D mesh models , 2004, Proceedings Shape Modeling Applications, 2004..

[25]  Jack Snoeyink,et al.  Computing contour trees in all dimensions , 2000, SODA '00.

[26]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[27]  Konstantin Mischaikow,et al.  Feature-based surface parameterization and texture mapping , 2005, TOGS.

[28]  Mikkel Thorup,et al.  Near-optimal fully-dynamic graph connectivity , 2000, STOC '00.

[29]  Valerio Pascucci,et al.  Contour trees and small seed sets for isosurface traversal , 1997, SCG '97.