Computing Reeb Graphs as a Union of Contour Trees

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...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 19(2013), 2 vom: 23. Feb., Seite 249-62
1. Verfasser: Doraiswamy, Harish (VerfasserIn)
Weitere Verfasser: Natarajan, Vijay
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2013
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM217252176
003 DE-627
005 20231224033636.0
007 cr uuu---uuuuu
008 231224s2013 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2012.115  |2 doi 
028 5 2 |a pubmed24n0724.xml 
035 |a (DE-627)NLM217252176 
035 |a (NLM)22529327 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Doraiswamy, Harish  |e verfasserin  |4 aut 
245 1 0 |a Computing Reeb Graphs as a Union of Contour Trees 
264 1 |c 2013 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 01.12.2015 
500 |a Date Revised 11.09.2015 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a 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 
650 4 |a Journal Article 
700 1 |a Natarajan, Vijay  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 19(2013), 2 vom: 23. Feb., Seite 249-62  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:19  |g year:2013  |g number:2  |g day:23  |g month:02  |g pages:249-62 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2012.115  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 19  |j 2013  |e 2  |b 23  |c 02  |h 249-62