Issue No.02 - Feb. (2013 vol.19)
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
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2012.115
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.
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
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