Constructing Reeb graphs using cylinder maps

The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds. 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. Arcs in the Reeb graph are computed in the second step using a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The algorithm is also able to handle non-manifold domains. Categories and Subject Descriptors: I.3.5 [Computational Geometry and Object Modeling]: Geometric algorithms, languages, and systems General Terms: Algorithms

• Type: Conference
• Year: 2010
• Where: COMPGEOM
• Authors: Harish Doraiswamy, Aneesh Sood, Vijay Natarajan
• Keywords: COMPGEOM 2010, Level Sets, Reeb Graph, Scalar Functions