A Parallel and Memory Efficient Algorithm for Constructing the Contour Tree

Acharya, Aditya and Natarajan, Vijay (2015) A Parallel and Memory Efficient Algorithm for Constructing the Contour Tree. In: IEEE Pacific Visualization Symposium (PacificVis), APR 14-17, 2015, Hangzhou, PEOPLES R CHINA, pp. 271-278.

PDF IEEE_Pac_Vis_Sys_271_2015.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

Abstract

The contour tree is a topological structure associated with a scalar function that tracks the connectivity of the evolving level sets of the function. It supports intuitive and interactive visual exploration and analysis of the scalar function. This paper describes a fast, parallel, and memory efficient algorithm for constructing the contour tree of a scalar function on shared memory systems. Comparisons with existing implementations show significant improvement in both the running time and the memory expended. The proposed algorithm is particularly suited for large datasets that do not fit in memory. For example, the contour tree for a scalar function defined on a 8.6 billion vertex domain (2048 x 2048 x 2048 volume data) can be efficiently constructed using less than 10GB of memory.

Item Type:	Conference Proceedings
Series.:	IEEE Pacific Visualization Symposium
Additional Information:	Copy right of this article belongs to the IEEE
Department/Centre:	Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre
Date Deposited:	08 Oct 2016 06:48
Last Modified:	08 Oct 2016 06:48
URI:	http://eprints.iisc.ac.in/id/eprint/54782

Actions (login required)

View Item