Hybrid Parallel Contour Trees, Version 1.0

Software · Tue Jan 03 00:00:00 EST 2017

OSTI ID:1337924

Sewell, Christopher ^[1]; Fasel, Patricia ^[1]; Carr, Hamish ^[2]; Weber, Gunther ^[3]

---

1. LANL
2. University of Leeds
3. LBNL

A common operation in scientific visualization is to compute and render a contour of a data set. Given a function of the form f : R^d -> R, a level set is defined as an inverse image f^-1(h) for an isovalue h, and a contour is a single connected component of a level set. The Reeb graph can then be defined to be the result of contracting each contour to a single point, and is well defined for Euclidean spaces or for general manifolds. For simple domains, the graph is guaranteed to be a tree, and is called the contour tree. Analysis can then be performed on the contour tree in order to identify isovalues of particular interest, based on various metrics, and render the corresponding contours, without having to know such isovalues a priori. This code is intended to be the first data-parallel algorithm for computing contour trees. Our implementation will use the portable data-parallel primitives provided by Nvidia’s Thrust library, allowing us to compile our same code for both GPUs and multi-core CPUs. Native OpenMP and purely serial versions of the code will likely also be included. It will also be extended to provide a hybrid data-parallel / distributed algorithm, allowing scaling beyond a single GPU or CPU.

• Short Name / Acronym: HPCT; 005092MLTPL00
• Project Type: Open Source under the BSD license.
• Site Accession Number: C17012
• Version: 00
• Programming Language(s): Medium: X; OS: Tested on Linux and Mac
• Research Organization: Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
• Sponsoring Organization: USDOE
• Contributing Organization: Los Alamos National Laboratory (LANL)
• DOE Contract Number: AC52-06NA25396
• OSTI ID: 1337924
• Country of Origin: United States