Abstract
The discrete Euclidean distance transform is applied to grids with non-cubic voxels, the face-centered cubic (fcc) and body-centered cubic (bcc) grids. These grids are three-dimensional generalizations of the hexagonal grid. Raster scanning and contour processing techniques are applied using different neighbourhoods. When computing the Euclidean distance transform, some voxel configurations produce errors. The maximum errors for the two different grids and neighbourhood sizes are analyzed and compared with the cubic grid.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bell, S.B.M., Holroyd, F.C., Mason, D.C.: A digital geometry for hexagonal pixels. Image and Vision Computing 7, 194–204 (1989)
Herman, G.T.: Geometry of Digital Spaces. Birkhäuser, Basel (1998)
Borgefors, G.: On digital distance transforms in three dimensions. Computer Vision and Image Understanding 64, 368–376 (1996)
Danielsson, P.E.: Euclidean distance mapping. Computer Graphics and Image Processing 14, 227–248 (1980)
Ragnemalm, I.: The Euclidean distance transform and its implementation on SIMD architectures. In: Proceedings of 6th Scandinavian Conference on Image Analysis, Oulu, Finland, pp. 379–384 (1989)
Ragnemalm, I.: The Euclidean distance transform in arbitrary dimensions. Pattern Recognition Letters 14, 883–888 (1993)
Strand, R., Borgefors, G.: Distance transforms for three-dimensional grids with non-cubic voxels (2004) (Submitted for publication)
Vincent, L.: Exact Euclidean distance function by chain propagations. In: Proceedings IEEE Conference on Computer Vision and Pattern Recognition, Maui, Hawaii, pp. 520–525 (1991)
Ragnemalm, I.: Neighborhoods for distance transformations using ordered propagation. Computer Vision, Graphics, and Image Processing 56, 399–409 (1992)
Cuisenaire, O., Macq, B.: Fast Euclidean distance transformation by propagation using multiple neighborhoods. Computer Vision and Image Understanding 76, 163–172 (1999)
Yamada, H.: Complete Euclidean distance transformation by parallel operation. In: Proceedings 7th international Conference on Pattern Recognition, Montreal, pp. 69–71 (1984)
Maurer, C.R., Qi, R., Raghavan, V.: A linear time algorithm for computing exact Euclidean distance transforms of binary images in arbitrary dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence 25, 265–270 (2003)
Breu, H., Gil, J., Kirkpatrick, D., Werman, M.: Linear time Euclidean distance transform algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence 17, 529–533 (1995)
Guan, W., Ma, S.: A list-processing approach to compute Voronoi diagrams and the Euclidean distance transform. IEEE Transactions on Pattern Analysis and Machine Intelligence 20, 757–761 (1998)
Mullikin, J.C.: The vector distance transform in two and three dimensions. CVGIP: Graphical Models and Image Processing 54, 526–535 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Strand, R. (2005). The Euclidean Distance Transform Applied to the FCC and BCC Grids. In: Marques, J.S., Pérez de la Blanca, N., Pina, P. (eds) Pattern Recognition and Image Analysis. IbPRIA 2005. Lecture Notes in Computer Science, vol 3522. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11492429_30
Download citation
DOI: https://doi.org/10.1007/11492429_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26153-7
Online ISBN: 978-3-540-32237-5
eBook Packages: Computer ScienceComputer Science (R0)