skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Hybrid Parallel Contour Trees, Version 1.0

Abstract

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 /more » distributed algorithm, allowing scaling beyond a single GPU or CPU.« less

Authors:
 [1];  [1];  [2];  [3]
  1. LANL
  2. University of Leeds
  3. LBNL
Publication Date:
Research Org.:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Org.:
USDOE
Contributing Org.:
Los Alamos National Laboratory (LANL)
OSTI Identifier:
1337924
Report Number(s):
HPCT; 005092MLTPL00
C17012
DOE Contract Number:  
AC52-06NA25396
Resource Type:
Software
Software Revision:
00
Software Package Number:
005092
Software CPU:
MLTPL
Open Source:
Yes
Open Source under the BSD license.
Source Code Available:
Yes
Related Software:
VTK-m
Country of Publication:
United States

Citation Formats

Sewell, Christopher, Fasel, Patricia, Carr, Hamish, and Weber, Gunther. Hybrid Parallel Contour Trees, Version 1.0. Computer software. https://www.osti.gov//servlets/purl/1337924. Vers. 00. USDOE. 3 Jan. 2017. Web.
Sewell, Christopher, Fasel, Patricia, Carr, Hamish, & Weber, Gunther. (2017, January 3). Hybrid Parallel Contour Trees, Version 1.0 (Version 00) [Computer software]. https://www.osti.gov//servlets/purl/1337924.
Sewell, Christopher, Fasel, Patricia, Carr, Hamish, and Weber, Gunther. Hybrid Parallel Contour Trees, Version 1.0. Computer software. Version 00. January 3, 2017. https://www.osti.gov//servlets/purl/1337924.
@misc{osti_1337924,
title = {Hybrid Parallel Contour Trees, Version 1.0, Version 00},
author = {Sewell, Christopher and Fasel, Patricia and Carr, Hamish and Weber, Gunther},
abstractNote = {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.},
url = {https://www.osti.gov//servlets/purl/1337924},
doi = {},
year = {Tue Jan 03 00:00:00 EST 2017},
month = {Tue Jan 03 00:00:00 EST 2017},
note =
}

Software:
To order this software, request consultation services, or receive further information, please fill out the following request.

Save / Share:

To initiate an order for this software, request consultation services, or receive further information, fill out the request form below. You may also reach us by email at: .

OSTI staff will begin to process an order for scientific and technical software once the payment and signed site license agreement are received. If the forms are not in order, OSTI will contact you. No further action will be taken until all required information and/or payment is received. Orders are usually processed within three to five business days.

Software Request

(required)
(required)
(required)
(required)
(required)
(required)
(required)
(required)