Scalable Parallel Distance Field Construction for Large-Scale Applications

Hongfeng Yu, Jinrong Xie, Kwan-Liu Ma, Hemanth Kolla, Jacqueline H. Chen

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Computing distance fields is fundamental to many scientific and engineering applications. Distance fields can be used to direct analysis and reduce data. In this paper, we present a highly scalable method for computing 3D distance fields on massively parallel distributed-memory machines. A new distributed spatial data structure, named parallel distance tree, is introduced to manage the level sets of data and facilitate surface tracking over time, resulting in significantly reduced computation and communication costs for calculating the distance to the surface of interest from any spatial locations. Our method supports several data types and distance metrics from real-world applications. We demonstrate its efficiency and scalability on state-of-the-art supercomputers using both large-scale volume datasets and surface models. We also demonstrate in-situ distance field computation on dynamic turbulent flame surfaces for a petascale combustion simulation. Our work greatly extends the usability of distance fields for demanding applications.

Original languageEnglish (US)
Article number7072474
Pages (from-to)1187-1200
Number of pages14
JournalIEEE Transactions on Visualization and Computer Graphics
Volume21
Issue number10
DOIs
StatePublished - Oct 1 2015

Fingerprint

Supercomputers
Data structures
Scalability
Data storage equipment
Communication
Costs

Keywords

  • distance field
  • geometric modeling
  • in-situ processing
  • large-scale scientific data analytics and visualization
  • parallel algorithms
  • scalability
  • scientific simulations
  • spatial data structures

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Computer Graphics and Computer-Aided Design

Cite this

Scalable Parallel Distance Field Construction for Large-Scale Applications. / Yu, Hongfeng; Xie, Jinrong; Ma, Kwan-Liu; Kolla, Hemanth; Chen, Jacqueline H.

In: IEEE Transactions on Visualization and Computer Graphics, Vol. 21, No. 10, 7072474, 01.10.2015, p. 1187-1200.

Research output: Contribution to journalArticle

Yu, Hongfeng ; Xie, Jinrong ; Ma, Kwan-Liu ; Kolla, Hemanth ; Chen, Jacqueline H. / Scalable Parallel Distance Field Construction for Large-Scale Applications. In: IEEE Transactions on Visualization and Computer Graphics. 2015 ; Vol. 21, No. 10. pp. 1187-1200.
@article{4a891e95af744e9b86f38ddfba162412,
title = "Scalable Parallel Distance Field Construction for Large-Scale Applications",
abstract = "Computing distance fields is fundamental to many scientific and engineering applications. Distance fields can be used to direct analysis and reduce data. In this paper, we present a highly scalable method for computing 3D distance fields on massively parallel distributed-memory machines. A new distributed spatial data structure, named parallel distance tree, is introduced to manage the level sets of data and facilitate surface tracking over time, resulting in significantly reduced computation and communication costs for calculating the distance to the surface of interest from any spatial locations. Our method supports several data types and distance metrics from real-world applications. We demonstrate its efficiency and scalability on state-of-the-art supercomputers using both large-scale volume datasets and surface models. We also demonstrate in-situ distance field computation on dynamic turbulent flame surfaces for a petascale combustion simulation. Our work greatly extends the usability of distance fields for demanding applications.",
keywords = "distance field, geometric modeling, in-situ processing, large-scale scientific data analytics and visualization, parallel algorithms, scalability, scientific simulations, spatial data structures",
author = "Hongfeng Yu and Jinrong Xie and Kwan-Liu Ma and Hemanth Kolla and Chen, {Jacqueline H.}",
year = "2015",
month = "10",
day = "1",
doi = "10.1109/TVCG.2015.2417572",
language = "English (US)",
volume = "21",
pages = "1187--1200",
journal = "IEEE Transactions on Visualization and Computer Graphics",
issn = "1077-2626",
publisher = "IEEE Computer Society",
number = "10",

}

TY - JOUR

T1 - Scalable Parallel Distance Field Construction for Large-Scale Applications

AU - Yu, Hongfeng

AU - Xie, Jinrong

AU - Ma, Kwan-Liu

AU - Kolla, Hemanth

AU - Chen, Jacqueline H.

PY - 2015/10/1

Y1 - 2015/10/1

N2 - Computing distance fields is fundamental to many scientific and engineering applications. Distance fields can be used to direct analysis and reduce data. In this paper, we present a highly scalable method for computing 3D distance fields on massively parallel distributed-memory machines. A new distributed spatial data structure, named parallel distance tree, is introduced to manage the level sets of data and facilitate surface tracking over time, resulting in significantly reduced computation and communication costs for calculating the distance to the surface of interest from any spatial locations. Our method supports several data types and distance metrics from real-world applications. We demonstrate its efficiency and scalability on state-of-the-art supercomputers using both large-scale volume datasets and surface models. We also demonstrate in-situ distance field computation on dynamic turbulent flame surfaces for a petascale combustion simulation. Our work greatly extends the usability of distance fields for demanding applications.

AB - Computing distance fields is fundamental to many scientific and engineering applications. Distance fields can be used to direct analysis and reduce data. In this paper, we present a highly scalable method for computing 3D distance fields on massively parallel distributed-memory machines. A new distributed spatial data structure, named parallel distance tree, is introduced to manage the level sets of data and facilitate surface tracking over time, resulting in significantly reduced computation and communication costs for calculating the distance to the surface of interest from any spatial locations. Our method supports several data types and distance metrics from real-world applications. We demonstrate its efficiency and scalability on state-of-the-art supercomputers using both large-scale volume datasets and surface models. We also demonstrate in-situ distance field computation on dynamic turbulent flame surfaces for a petascale combustion simulation. Our work greatly extends the usability of distance fields for demanding applications.

KW - distance field

KW - geometric modeling

KW - in-situ processing

KW - large-scale scientific data analytics and visualization

KW - parallel algorithms

KW - scalability

KW - scientific simulations

KW - spatial data structures

UR - http://www.scopus.com/inward/record.url?scp=84941095782&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84941095782&partnerID=8YFLogxK

U2 - 10.1109/TVCG.2015.2417572

DO - 10.1109/TVCG.2015.2417572

M3 - Article

VL - 21

SP - 1187

EP - 1200

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

SN - 1077-2626

IS - 10

M1 - 7072474

ER -