Abstract
We denote by ℳ n R the test neighbourhood sufficient to extract the Euclidean Medial Axis of any n-dimensional discrete shape whose inner radius is no greater than R. In this paper, we study properties of discrete Euclidean disks overlappings so as to prove that in any given dimension n, ℳ n R tends to the set of visible vectors as R tends to infinity.
Article PDF
Similar content being viewed by others
References
Arcelli, C., Sanniti di Baja, G.: Finding local maxima in a pseudo-Euclidean distance transform. Comput. Vis. Graph. Image Process. 43, 361–367 (1988)
Blum, H.: A transformation for extracting new descriptors of shape. In: Wathen-Dunn, W. (ed.) Models for the Perception of Speech and Visual Form, pp. 362–380. MIT Press, Cambridge (1967)
Borgefors, G.: Distance transformations in arbitrary dimensions. Comput. Vis. Graph. Image Process. 27, 321–345 (1984)
Borgefors, G., Ragnemalm, I., Sanniti di Baja, G.: The Euclidean distance transform: finding the local maxima and reconstructing the shape. In: 7th Scandinavian Conf. on Image Analysis, vol. 2, pp. 974–981. Aalborg, Denmark (1991)
Borgefors, G.: Centres of maximal disks in the 5–7–11 distance transform. In: 8th Scandinavian Conf. on Image Analysis, pp. 105–111. Tromsø, Norway (1993)
Coeurjolly, D.: d-Dimensional reverse Euclidean distance transformation and Euclidean medial axis extraction in optimal time. In: 11th DGCI, Naples, Italy, November 2003. Lecture Notes in Computer Sience, vol. 2886, pp. 327–337. Springer, Berlin (2003)
Hirata, T.: A unified linear-time algorithm for computing distance maps. Inf. Process. Lett. 58(3), 129–133 (1996)
Montanari, U.: A method for obtaining skeletons using a quasi-euclidean distance. J. ACM 15, 600–624 (1968)
Normand, N., Évenou, P.: Medial axis LUT computation for chamfer norms using H-polytopes. In: 14th Discrete Geometry for Computer Imagery, Lyon, France, April 2008. Lecture Notes in Computer Sience, vol. 4992, pp. 189–200. Springer, Berlin (2008)
Pfaltz, J.L., Rosenfeld, A.: Computer representation of planar regions by their skeletons. Commun. ACM 10, 119–125 (1967)
Saito, T., Toriwaki, J.I.: New algorithms for Euclidean distance transformation of an n-dimensional digitized picture with applications. Pattern Recogn. 27(11), 1551–1565 (1994)
Saúde, A.V., Couprie, M., Lotufo, R.: Exact Euclidean medial axis in higher resolution. In: 13th Discrete Geometry for Computer Imagery, Szeged, Hungary, October 2006. Lecture Notes in Computer Sience, vol. 4245, pp. 605–616. Springer, Berlin (2006)
Rémy, E., Thiel, E.: Medial axis for chamfer distances: computing LUT and neighbourhoods in 2D or 3D. Pattern Recogn. Lett. 23(6), 649–661 (2002)
Rémy, E., Thiel, E.: Exact medial axis with Euclidean distance. Image Vis. Comput. 23(2), 167–175 (2005)
Rosenfeld, A., Pfaltz, J.L.: Sequential operations in digital picture processing. J. ACM 13(4), 471–494 (1966)
Author information
Authors and Affiliations
Corresponding author
Additional information
J. Hulin and E. Thiel research was supported in part by ANR grant BLAN06-1-138894 (projet OPTICOMB).
Rights and permissions
About this article
Cite this article
Hulin, J., Thiel, E. Visible Vectors and Discrete Euclidean Medial Axis. Discrete Comput Geom 42, 759–773 (2009). https://doi.org/10.1007/s00454-008-9126-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-008-9126-2