Parallel Banding Algorithm to compute exact distance transform with the GPU

Authors:
Thanh-Tung Cao;Ke Tang;Anis Mohamed;Tiow-Seng Tan
Affiliations:
National University of Singapore;National University of Singapore;National University of Singapore;National University of Singapore
Venue:
Proceedings of the 2010 ACM SIGGRAPH symposium on Interactive 3D Graphics and Games
Year:
2010

Citing 14
Cited 21

Fast computation of the Euclidian distance maps for binary images: Fast computations of the Euclidean distance maps for binary images

Information Processing Letters
Optimal Parallel Algorithms for Finding Proximate Points, with Applications

IEEE Transactions on Parallel and Distributed Systems
Fast computation of generalized Voronoi diagrams using graphics hardware

Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Weighted Voronoi stippling

NPAR '02 Proceedings of the 2nd international symposium on Non-photorealistic animation and rendering
A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions

IEEE Transactions on Pattern Analysis and Machine Intelligence
Parallel Computation of the Euclidean Distance Transform on a Three-Dimensional Image Array

IEEE Transactions on Parallel and Distributed Systems
Jump flooding in GPU with applications to Voronoi diagram and distance transform

I3D '06 Proceedings of the 2006 symposium on Interactive 3D graphics and games
Interactive 3D distance field computation using linear factorization

I3D '06 Proceedings of the 2006 symposium on Interactive 3D graphics and games
3D Distance Fields: A Survey of Techniques and Applications

IEEE Transactions on Visualization and Computer Graphics
Variants of Jump Flooding Algorithm for Computing Discrete Voronoi Diagrams

ISVD '07 Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering
Scan primitives for GPU computing

Proceedings of the 22nd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
2D Euclidean distance transform algorithms: A comparative survey

ACM Computing Surveys (CSUR)
Computing two-dimensional Delaunay triangulation using graphics hardware

Proceedings of the 2008 symposium on Interactive 3D graphics and games
Euclidean Skeletons of Digital Image and Volume Data in Linear Time by the Integer Medial Axis Transform

IEEE Transactions on Pattern Analysis and Machine Intelligence

Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm design

Proceedings of the twenty-sixth annual symposium on Computational geometry
3-view impostors

Proceedings of the 7th International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa
gHull: a three-dimensional convex hull algorithm for graphics hardware

I3D '11 Symposium on Interactive 3D Graphics and Games
Parallel re-initialization of level set functions on distributed unstructured tetrahedral grids

Journal of Computational Physics
Voxel-based assessment of printability of 3D shapes

ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
Computing 2D constrained Delaunay triangulation using the GPU

I3D '12 Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
SMI 2012: Full GPU accelerated convex hull computation

Computers and Graphics
Accelerating batch processing of spatial raster analysis using GPU

Computers & Geosciences
Constructing natural neighbor interpolation based grid DEM using CUDA

Proceedings of the 3rd International Conference on Computing for Geospatial Research and Applications
Efficient Euclidean distance transform algorithm of binary images in arbitrary dimensions

Pattern Recognition
Three-dimensional thinning algorithms on graphics processing units and multicore CPUs

Concurrency and Computation: Practice & Experience
GPU-based offset surface computation using point samples

Computer-Aided Design
Parallel computing 2D Voronoi diagrams using untransformed sweepcircles

Computer-Aided Design
Parallel design for error-resilient entropy coding algorithm on GPU

Journal of Parallel and Distributed Computing
CudaGIS: report on the design and realization of a massive data parallel GIS on GPUs

Proceedings of the Third ACM SIGSPATIAL International Workshop on GeoStreaming
Examples from computational geometry that demonstrate the potential of using the thrust library to implement parallel processing on GPUs

Journal of Computing Sciences in Colleges
A fast algorithm for liver surgery planning

DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Real-time rendering of water surfaces with cartography-oriented design

Proceedings of the Symposium on Computational Aesthetics
gHull: A GPU algorithm for 3D convex hull

ACM Transactions on Mathematical Software (TOMS)
Special Section on CAD/Graphics 2013: Parallel and adaptive visibility sampling for rendering dynamic scenes with spatially varying reflectance

Computers and Graphics
High resolution topology optimization using graphics processing units (GPUs)

Structural and Multidisciplinary Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary image in 2D and higher dimensions. Partitioning the image into small bands to process and then merging them concurrently, PBA computes the exact EDT with optimal linear total work, high level of parallelism and a good memory access pattern. This work is the first attempt to exploit the enormous power of the GPU in computing the exact EDT, while prior works are only on approximation. Compared to these other algorithms in our experiments, our exact algorithm is still a few times faster in 2D and 3D for most input sizes. We illustrate the use of our algorithm in applications such as computing the Euclidean skeleton using the integer medial axis transform, performing morphological operations of 3D volumetric data, and constructing 2D weighted centroidal Voronoi diagrams.