A unified linear-time algorithm for computing distance maps
References (13)
Distance transformations in digital images
Comput. Graphics and Image Process.
(1986)- et al.
A fast algorithm for Euclidean distance maps of a 2-D binary image
Inform. Process. Lett.
(1994) Euclidean distance mapping
Comput. Graphics and Image Process.
(1980)- et al.
Fast computation of Euclidean distance maps for binary images
Inform. Process. Lett.
(1992) - et al.
Geometric applications of a matrix-searching algorithm
Algorithmica
(1987) - et al.
Linear time Euclidean distance transform algorithms
IEEE Trans. Pattern Analysis and Machine Intelligence
(1995)
Cited by (127)
Efficient distance transformation for path-based metrics
2020, Computer Vision and Image UnderstandingHigh throughput automated detection of axial malformations in Medaka embryo
2019, Computers in Biology and MedicineThe Delta Medial Axis: A fast and robust algorithm for filtered skeleton extraction
2016, Pattern RecognitionCitation Excerpt :In [22], Postolski highlights the fact that the Scale Axis Transform is not necessarily a subset of the original shape, and extends Miklos׳ work to propose a solution that guarantees a better approximation of the RMA. In this section, we introduce the notions of projection and distance transforms, and briefly present a linear-time algorithm proposed by Hirata [14] (for distance), and extended by Hesselink [2] (for projection), to compute them in the case of binary images. Distance transform
Generation of hierarchical multi-resolution medial axis for CAD models
2016, Advances in Engineering SoftwareCalculating the medial axis of a CAD model by multi-CPU based parallel computation
2015, Advances in Engineering SoftwareConstructive generation of the medial axis for solid models
2015, CAD Computer Aided DesignCitation Excerpt :To speed up the Voronoi graph-based MA generation method, A. Meijster et al. separated the grid points of the image into independent rows and columns; thus, it is well suited for parallelization on a shared-memory machine [32]. T. Hirata devised an efficient algorithm for each row to find the lower envelope of the minima of the set of distance functions [33]. In the incremental method proposed by R. Ramamurthy and R.T. Farouki [34], a single boundary segment was added to an existing boundary-segment set at each step, modifying the Voronoi regions of the existing boundary segments.