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

Computing Contour Trees for 2D Piecewise Polynomial Functions

Nucha, Girijanandan and Bonneau, Georges-Pierre and Hahmann, Stefanie and Natarajan, Vijay (2017) Computing Contour Trees for 2D Piecewise Polynomial Functions. In: COMPUTER GRAPHICS FORUM, 36 (3). pp. 23-33.

Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1111/cgf.13165


Contour trees are extensively used in scalar field analysis. The contour tree is a data structure that tracks the evolution of level set topology in a scalar field. Scalar fields are typically available as samples at vertices of a mesh and are linearly interpolated within each cell of the mesh. A more suitable way of representing scalar fields, especially when a smoother function needs to be modeled, is via higher order interpolants. We propose an algorithm to compute the contour tree for such functions. The algorithm computes a local structure by connecting critical points using a numerically stable monotone path tracing procedure. Such structures are computed for each cell and are stitched together to obtain the contour tree of the function. The algorithm is scalable to higher degree interpolants whereas previous methods were restricted to quadratic or linear interpolants. The algorithm is intrinsically parallelizable and has potential applications to isosurface extraction.

Item Type: Journal Article
Additional Information: Copy right for this article belongs to the WILEY, 111 RIVER ST, HOBOKEN 07030-5774, NJ USA
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 29 Jul 2017 10:09
Last Modified: 06 Nov 2018 12:54
URI: http://eprints.iisc.ac.in/id/eprint/57518

Actions (login required)

View Item View Item