d-Dimensional reverse Euclidean distance transformation and Euclidean medial axis extraction in optimal time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2886, Issue , 2003, Pages 327-337

  Coeurjolly, David ^a  

^a UNIVERSITÉ LUMIÈRE LYON 2   (France)

Author keywords

d dimensional shapes; Medial axis extraction; Reverse Euclidean distance transform

Indexed keywords

ALGORITHMS; EXTRACTION;

EUCLIDEAN; EUCLIDEAN DISTANCE; EUCLIDEAN DISTANCE TRANSFORMS; MEDIAL AXIS; OPTIMAL TIME; TIME ALGORITHMS;

GEOMETRY;

EID: 0242460261     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39966-7_31     Document Type: Article

References (19)

1. H. Blum. A transformation for extracting descriptors of shape. In Models for the Perception of Speech and Visual Forms, pages 362-380. MIT Press, 1967.
2. G. Borgefors. Distance transformations in digital images. Computer Vision, Graphics, and Image Processing, 34(3):344-371, June 1986.
3. G. Borgefors and I. Nyström. Efficient shape representation by minimizing the set of centers of maximal discs/spheres. Pattern Recognition Letters, 18:465-472, 1997.
4. D. Coeurjolly. Algorithmique et géométrie discrète pour la caractérisation des courbes et des surfaces. PhD thesis, Université Lumière Lyon 2, Bron, Laboratoire ERIC, dec 2002.
5. P. E. Danielsson. Euclidean distance mapping. CGIP, 14:227-248, 1980.
6. G. Sanniti di Baja. Well-shaped, stable, and reversible skeletons from the (3,4)-distance transform. J. Visual Communication and Image Representation, 5:107-115, 1994.
7. T. Hirata. A unified linear-time algorithm for computing distance maps. Information Processing Letters, 58(3):129-133, May 1996.
8. C.R. Maurer Jr., V. Raghavan, and R. Qi. A linear time algorithm for computing the euclidean distance transform in arbitrary dimensions. In Information Processing in Medical Imaging, pages 358-364, 2001.
9. A. Meijster, J.B.T.M. Roerdink, and W. H. Hesselink. A general algorithm for computing distance transforms in linear time. In Mathematical Morphology and its Applications to Image and Signal Processing, pages 331-340. Kluwer, 2000.
10. U. Montanari. Continuous skeletons from digitized images. Journal of the Association for Computing Machinery, 16(4):534-549, oct 1969.
11. F. Nilsson and P.-E. Danielsson. Finding the minimal set of maximum disks for binary objects. Graphical models and image processing, 59(1):55-60, January 1997.
12. I. Ragnemalm. Contour processing distance transforms, pages 204-211. World Scientific, 1990.
13. I. Ragnemalm. The Euclidean Distance Transform. PhD thesis, Linköping University, Linköping, Sweden, 1993.
14. E. Remy and E. Thiel. Optimizing 3D chamfer masks with norm constraints. In Int. Workshop on Combinatorial Image Analysis, pages 39-56, Caen, July 2000.
15. A. Rosenfeld and J. L. Pfaltz. Sequential operations in digital picture processing. Journal of the ACM, 13(4):471-494, October 1966.
16. A. Rosenfeld and J. L. Pfalz. Distance functions on digital pictures. Pattern Recognition, 1:33-61, 1968.
17. T. Saito and J. I. Toriwaki. New algorithms for Euclidean distance transformations of an n-dimensional digitized picture with applications. Pattern Recognition, 27:1551-1565, 1994.
18. T. Saito and J.-I. Toriwaki. Reverse distance transformation and skeletons based upon the euclidean metric for n-dimensionnal digital pictures. IECE Trans. Inf. & Syst., E77-D(9):1005-1016, sept. 1994.
19. E. Thiel. Géométrie des distances de chanfrein. Habilitation à Diriger des Recherches, Université de la Méditerranée, Aix-Marseille 2, Déc 2001.