Parallel Computation of 3D Morse-Smale Complexes

Simple item page
dc.contributor.authorShivashankar, Nithinen_US
dc.contributor.authorNatarajan, Vijayen_US
dc.contributor.editorS. Bruckner, S. Miksch, and H. Pfisteren_US
dc.date.accessioned2015-02-28T07:01:46Z
dc.date.available2015-02-28T07:01:46Z
dc.date.issued2012en_US
dc.description.abstractThe 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.en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume31
dc.identifier.doi10.1111/j.1467-8659.2012.03089.x
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2012.03089.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleParallel Computation of 3D Morse-Smale Complexesen_US
Files
Collections
31-Issue 3
EuroVis12: Eurographics Conference on Visualization