Reeb Graphs: Approximation and Persistence

Given a continuous function f :X→ℝ on a topological space X, its level set f −1 ( a ) changes continuously as the real value a changes. Consequently, the connected components in the level sets appear, disappear, split and merge. The Reeb graph of f summarizes this information into a graph structure....

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete & computational geometry 2013, Vol.49 (1), p.46-73
Hauptverfasser:	Dey, Tamal K., Wang, Yusu
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Byproducts Combinatorics Computation Computational efficiency Computational Mathematics and Numerical Analysis Graphs Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Topological manifolds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!