Parallel Computation of 2D Morse-Smale Complexes


Autoria(s): Shivashankar, Nithin; Senthilnathan, M; Natarajan, Vijay
Data(s)

13/12/2012

Resumo

The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh elements of the domain in parallel to compute the Morse-Smale complex of large two-dimensional data sets at interactive speeds. We employ a reformulation of the Morse-Smale complex using Forman's Discrete Morse Theory and achieve scalability by computing the discrete gradient using local accesses only. We also introduce a novel approach to merge gradient paths that ensures accurate geometry of the computed complex. We demonstrate that our algorithm performs well on both multicore environments and on massively parallel architectures such as the GPU.

Formato

application/pdf

application/pdf

application/pdf

Identificador

http://eprints.iisc.ernet.in/42905/1/Parallel_Computation.pdf

http://eprints.iisc.ernet.in/42905/4/ieee_tran_vis_comp_gra_18-20_1757.pdf

http://eprints.iisc.ernet.in/42905/5/ttg2012101757s.pdf

Shivashankar, Nithin and Senthilnathan, M and Natarajan, Vijay (2012) Parallel Computation of 2D Morse-Smale Complexes. In: TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 18 (10). pp. 1756-1770.

Publicador

IEEE

Relação

http://dx.doi.org/10.1109/TVCG.2011.284

http://eprints.iisc.ernet.in/42905/

Palavras-Chave #Computer Science & Automation (Formerly, School of Automation) #Supercomputer Education & Research Centre
Tipo

Journal Article

PeerReviewed