On-Demand Augmentation of Contour Trees

Sharma, M and Natarajan, V (2018) On-Demand Augmentation of Contour Trees. In: 11th Indian Conference on Computer Vision, Graphics and Image Processing, ICVGIP 2018, 18-22 December 2018, International Institute of Information Technology, Hyderabad.

PDF On-Dem-Aug-Con-Tre.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

Abstract

The contour tree represents the topology of level sets of a scalar function. Nodes of the tree correspond to critical level sets and arcs of the tree represent a collection of topologically equivalent level sets connecting two critical level sets. The augmented contour tree contains degree-2 nodes on the arcs that represent regular level sets. The degree-2 nodes correspond to regular points of the scalar function and other critical points that do not affect the number of level set components. The augmented contour tree is significantly larger in size and requires more effort to compute when compared to the contour tree. Applications of the contour tree to data exploration and visualization require the augmented contour tree. Current approaches propose algorithms to compute the contour tree and the augmented contour tree from scratch. Precomputing and storing the large augmented contour tree will not be necessary if the contour tree can be augmented on-demand. This paper poses the problem of computing the augmented contour tree given a contour tree as input. Computational experiments demonstrate that the on-demand augmentation can be computed fast while resulting in good memory savings. © 2018 ACM.

Item Type:	Conference Paper
Publication:	ACM International Conference Proceeding Series
Publisher:	Association for Computing Machinery
Additional Information:	cited By 0; Conference of 11th Indian Conference on Computer Vision, Graphics and Image Processing, ICVGIP 2018 ; Conference Date: 18 December 2018 Through 22 December 2018; Conference Code:165785
Keywords:	Computer vision; Data visualization; Forestry; Topology, Computational experiment; Contour trees; Critical level; Data exploration; Memory savings; Precomputing; Regular point; Scalar function, Trees (mathematics)
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	11 Jan 2021 11:22
Last Modified:	11 Jan 2021 11:22
URI:	http://eprints.iisc.ac.in/id/eprint/67650

Actions (login required)

View Item