Computing Contour Trees for 2D Piecewise Polynomial Functions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computer Graphics Forum Year : 2017

Computing Contour Trees for 2D Piecewise Polynomial Functions


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.
Fichier principal
Vignette du fichier
EuroVis2017_NuchaBonneauHahmannNatarajan.pdf (17.25 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01494431 , version 1 (23-03-2017)



Girijanandan Nucha, Georges-Pierre Bonneau, Stefanie Hahmann, Vijay Natarajan. Computing Contour Trees for 2D Piecewise Polynomial Functions. Computer Graphics Forum, 2017, 36 (3), pp.23-33. ⟨10.1111/cgf.13165⟩. ⟨hal-01494431⟩
487 View
301 Download



Gmail Facebook Twitter LinkedIn More