DeepAI AI Chat
Log In Sign Up

TACHYON: Efficient Shared Memory Parallel Computation of Extremum Graphs

by   Abhijath Ande, et al.

The extremum graph is a succinct representation of the Morse decomposition of a scalar field. It has increasingly become a useful data structure that supports topological feature directed visualization of 2D / 3D scalar fields, and enables dimensionality reduction together with exploratory analysis of high dimensional scalar fields. Current methods that employ the extremum graph compute it either using a simple sequential algorithm for computing the Morse decomposition or by computing the more detailed Morse-Smale complex. Both approaches are typically limited to two and three dimensional scalar fields. We describe a GPU-CPU hybrid parallel algorithm for computing the extremum graph of scalar fields in all dimensions. The proposed shared memory algorithm utilizes both fine grained parallelism and task parallelism to achieve efficiency. An open source software library, TACHYON, that implements the algorithm exhibits superior performance and good scaling behavior.


page 3

page 5

page 7

page 10


GPU Parallel Computation of Morse-Smale Complexes

The Morse-Smale complex is a well studied topological structure that rep...

Autoencoder-Aided Visualization of Collections of Morse Complexes

Though analyzing a single scalar field using Morse complexes is well stu...

Visualization of High-dimensional Scalar Functions Using Principal Parameterizations

Insightful visualization of multidimensional scalar fields, in particula...

An Improved and Optimized Practical Non-Blocking PageRank Algorithm for Massive Graphs

PageRank is a well-known algorithm whose robustness helps set a standard...

Localized Topological Simplification of Scalar Data

This paper describes a localized algorithm for the topological simplific...

GPU Parallelization of Policy Iteration RRT#

Sampling-based planning has become a de facto standard for complex robot...