ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Efficient Output-Sensitive Construction of Reeb Graphs

Doraiswamy, Harish and Natarajan, Vijay (2008) Efficient Output-Sensitive Construction of Reeb Graphs. [Book Chapter]

Full text not available from this repository. (Request a copy)
Official URL: http://www.springerlink.com/content/54v91t54373558...


The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. This paper describes a near-optimal two-step algorithm that constructs the Reeb graph of a Morse function defined over manifolds in any dimension. The algorithm first identifies the critical points of the input manifold, and then connects these critical points in the second step to obtain the Reeb graph. A simplification mechanism based on topological persistence aids in the removal of noise and unimportant features. A radial layout scheme results in a feature-directed drawing of the Reeb graph. Experimental results demonstrate the efficiency of the Reeb graph construction in practice and its applications.

Item Type: Book Chapter
Series.: Lecture Notes in Computer Science
Publisher: Springer
Additional Information: Copyright of this article belongs to Springer.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 02 Jun 2009 11:41
Last Modified: 02 Jun 2009 11:41
URI: http://eprints.iisc.ac.in/id/eprint/19754

Actions (login required)

View Item View Item