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

Title: Data-Parallel Algorithm for Contour Tree Construction

Abstract

The goal of this project is to develop algorithms for additional visualization and analysis filters in order to expand the functionality of the VTK-m toolkit to support less critical but commonly used operators.

Authors:
 [1];  [1];  [2];  [3]
  1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
  2. Univ. of Leeds (United Kingdom)
  3. Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
Publication Date:
Research Org.:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Org.:
USDOE Office of Science (SC). Advanced Scientific Computing Research (ASCR) (SC-21)
OSTI Identifier:
1340949
Report Number(s):
LA-UR-17-20363
DOE Contract Number:
AC52-06NA25396
Resource Type:
Technical Report
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING; Computer Science

Citation Formats

Sewell, Christopher Meyer, Ahrens, James Paul, Carr, Hamish, and Weber, Gunther. Data-Parallel Algorithm for Contour Tree Construction. United States: N. p., 2017. Web. doi:10.2172/1340949.
Sewell, Christopher Meyer, Ahrens, James Paul, Carr, Hamish, & Weber, Gunther. Data-Parallel Algorithm for Contour Tree Construction. United States. doi:10.2172/1340949.
Sewell, Christopher Meyer, Ahrens, James Paul, Carr, Hamish, and Weber, Gunther. Thu . "Data-Parallel Algorithm for Contour Tree Construction". United States. doi:10.2172/1340949. https://www.osti.gov/servlets/purl/1340949.
@article{osti_1340949,
title = {Data-Parallel Algorithm for Contour Tree Construction},
author = {Sewell, Christopher Meyer and Ahrens, James Paul and Carr, Hamish and Weber, Gunther},
abstractNote = {The goal of this project is to develop algorithms for additional visualization and analysis filters in order to expand the functionality of the VTK-m toolkit to support less critical but commonly used operators.},
doi = {10.2172/1340949},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Thu Jan 19 00:00:00 EST 2017},
month = {Thu Jan 19 00:00:00 EST 2017}
}

Technical Report:

Save / Share:
  • The model of parallel computation that is used in this paper is the concurrent-read concurrent-write (CRCW) parallel random access machine (PRAM). We assume that several processors may attempt to write at the same memory location only if they are seeking to write the same value (the so called, Common CRCW PRAM). We use the weakest Common CRCW PRAM model, in which only concurrent writes of the value one are allowed. Given two parallel algorithms for the same problem one is more efficient than the other if: (1) primarily, its time-processor product is smaller, and (2) secondarily (but important), its parallelmore » time is smaller. Optimal parallel algorithms are those with a linear time-processor product. A fully-parallel algorithm that runs in constant time using an optimal number of processors. An almost fully-parallel algorithm is a parallel algorithm that runs in alpha(n) (the inverse of Ackermann function) time using on optimal number of processors. The notion of fully-parallel algorithm represents an ultimate theoretical goal for designers of parallel algorithms. Research on lower bounds for parallel computation (see references later) indicates that for nearly any interesting problem this goal is unachievable. These same results also preclude almost fully-parallel algorithms for the same problems. Therefore, any result that approaches this goal is somewhat surprising.« less
  • This paper is a study of a highly decomposable algorithm useful for the parallel generation of a contour surface display. The core component of this algorithm is a two-dimensional contouring algorithm that operates on a single, 2 x 2 subgrid of a larger grid. A model for the operations used to generate the contour lines for a single subgrid is developed. The inadequacies of the currently published algorithms, with respect to contour line generation for a subgrid, are pointed out in a brief review of the available literature. A data structure, the contouring tree, is introduced as the basis ofmore » a new algorithm for generating the contour lines for the subgrid. The construction of the contouring tree, and the completeness of an algorithm based upon the contouring tree, within the constraints of the contouring model are shown.« less
  • This report explains a mathematical algorithm designed to complete contour descriptions of weapon components which have been only partially specified by free-form data.