A hybrid solution to parallel calculation of augmented join trees of scalar fields in any dimension. Issue 4 (4th July 2018)

• Record Type: Journal Article
• Authors: Rosen, Paul; Tu, Junyi; Piegl, Les A.
• Is Part Of: Computer-aided design and applications. Volume 15:Issue 4(2018)
• Page Start: 610
• Page End: 618
• Publication Date: 2018-07-04
• Subjects: Data analysis -- computational topology -- scalar field; Computer-aided design -- Congresses; Computer-aided design -- Periodicals; Engineering design -- Data processing -- Congresses; Engineering design -- Periodicals; 620.00420285
• DOI: 10.1080/16864360.2017.1419648
• Languages: English
• ISSNs: 1686-4360

Abstract

ABSTRACT: Scalar fields are used to describe a variety of data from photographs, to laser scans, to x-ray, CT or MRI scans of machine parts and are invaluable for a variety of tasks, such as fatigue detection in parts. Analyzing scalar fields can be quite challenging due to their size, complexity, and the need to understand both local and global details in context. Join trees are a data structure used to capture the geometric properties of scalar fields, including local minima, local maxima, and saddle points. Unfortunately, computing these trees is expensive, and their incremental construction makes parallel computation nontrivial. We introduce an approach that combines three strategies, pruning, spatial-domain parallelization, and value-domain parallelization, to parallelize join tree construction using OpenCL. The resulting implementation shows a significant speedup, making computation of trees on large data practical on even modest commodity hardware. GRAPHICAL ABSTRACT: