2015 IEEE Pacific Visualization Symposium (PacificVis) (2015)

Hangzhou, China

April 14, 2015 to April 17, 2015

ISBN: 978-1-4673-6879-7

pp: 271-278

Aditya Acharya , Supercomputer Education and Research Centre, Indian Institute of Science, Bangalore, India

Vijay Natarajan , Department of Computer Science and Automation, Supercomputer Education and Research Centre, Indian Institute of Science, Bangalore, India

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×2048×2048 volume data) can be efficiently constructed using less than 10GB of memory.

INDEX TERMS

Level set, Data visualization, Memory management, Vegetation, Program processors, Algorithm design and analysis, Parallel algorithms,I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling,

CITATION

Aditya Acharya,
Vijay Natarajan,
"A parallel and memory efficient algorithm for constructing the contour tree",

*2015 IEEE Pacific Visualization Symposium (PacificVis)*, vol. 00, no. , pp. 271-278, 2015, doi:10.1109/PACIFICVIS.2015.7156387