A fast algorithm for computation of discrete Euclidean distance transform in three or more dimensions on vector processing architectures
- 4 January 2013
- journal article
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 9 (1) , 19-27
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Ultrastructural Analysis of Hippocampal Neuropil from the Connectomics PerspectiveNeuron, 2010
- Whole cell segmentation in solid tissue sectionsCytometry Part A, 2005
- Two Fast Euclidean Distance Transformations in Z2Based on Sufficient PropagationComputer Vision and Image Understanding, 1998
- Voronoi tessellation of points with integer coordinates: Time-efficient implementation and online edge-list generationPattern Recognition, 1995
- New algorithms for euclidean distance transformation of an n-dimensional digitized picture with applicationsPattern Recognition, 1994
- A fast algorithm for Euclidean distance maps of a 2-D binary imageInformation Processing Letters, 1994
- A unified distance transform algorithm and architectureMachine Vision and Applications, 1992
- Distance transforms: Properties and machine vision applicationsCVGIP: Graphical Models and Image Processing, 1992
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- Distance transformations in arbitrary dimensionsComputer Vision, Graphics, and Image Processing, 1984