期刊
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
卷 19, 期 2, 页码 249-262出版社
IEEE COMPUTER SOC
DOI: 10.1109/TVCG.2012.115
关键词
Computational topology; scalar functions; Reeb graphs; level set topology; out-of-core algorithm
资金
- Department of Science and Technology, India [SR/S3/EECE/048/2007]
- Microsoft Corporation
- Microsoft Research India under the Microsoft Research India PhD Fellowship Award
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据