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.
authors.forename: Hongfeng
authors.initials: H
authors.lastname: Yu
authors.forename: Jinrong
authors.initials: J
authors.lastname: Xie
authors.forename: Kwan-Liu
authors.initials: KL
authors.lastname: Ma
authors.forename: Hemanth
authors.initials: H
authors.lastname: Kolla
authors.forename: Jacqueline H
authors.initials: JH
authors.lastname: Chen