Computing Reeb Graphs as a Union of Contour Trees

Doraiswamy, Harish and Natarajan, Vijay (2013) Computing Reeb Graphs as a Union of Contour Trees. In: IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 19 (2). pp. 249-262.

Preview	PDF ieee_tran_vis_comp_19-2_249_2012.pdf - Accepted Version Download (473kB) | Preview
	PDF ieee_tran_vis_com_19-2_249_2012.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

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.

Item Type:	Journal Article
Publication:	IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
Publisher:	IEEE COMPUTER SOC
Additional Information:	Copyright for this article belongs to IEEE COMPUTER SOC,USA
Keywords:	Computational topology;scalar functions;Reeb graphs;level set topology;out-of-core algorithm
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre
Date Deposited:	28 Jan 2013 07:28
Last Modified:	28 Jan 2013 07:35
URI:	http://eprints.iisc.ac.in/id/eprint/45651

Actions (login required)

View Item