Parallel Computation of 3D Morse-Smale Complexes

Shivashankar, Nithin and Natarajan, Vijay (2012) Parallel Computation of 3D Morse-Smale Complexes. In: COMPUTER GRAPHICS FORUM, 31 (3, Par). pp. 965-974.

	PDF comp_grap_foru_31-3_965-974_2012.pdf - Published Version Restricted to Registered users only Download (2MB) | Request a copy
	PDF comp_grap_foru_31-3-supp_2012.pdf - Published Supplemental Material Restricted to Registered users only Download (936kB) | Request a copy

Abstract

The Morse-Smale complex is a topological structure that captures the behavior of the gradient of a scalar function on a manifold. This paper discusses scalable techniques to compute the Morse-Smale complex of scalar functions defined on large three-dimensional structured grids. Computing the Morse-Smale complex of three-dimensional domains is challenging as compared to two-dimensional domains because of the non-trivial structure introduced by the two types of saddle criticalities. We present a parallel shared-memory algorithm to compute the Morse-Smale complex based on Forman's discrete Morse theory. The algorithm achieves scalability via synergistic use of the CPU and the GPU. We first prove that the discrete gradient on the domain can be computed independently for each cell and hence can be implemented on the GPU. Second, we describe a two-step graph traversal algorithm to compute the 1-saddle-2-saddle connections efficiently and in parallel on the CPU. Simultaneously, the extremasaddle connections are computed using a tree traversal algorithm on the GPU.

Item Type:	Journal Article
Publication:	COMPUTER GRAPHICS FORUM
Publisher:	WILEY-BLACKWELL
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre
Date Deposited:	30 Jul 2012 05:46
Last Modified:	31 Jul 2012 12:12
URI:	http://eprints.iisc.ac.in/id/eprint/44862

Actions (login required)

View Item