Look-up tables for Medial Axis on Squared Euclidean Distance Transform

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

Volumn 2886, Issue , 2003, Pages 224-235

  Remy, Eric ^a   Thiel, Edouard ^a  

^a AIX MARSEILLE UNIV   (France)

Author keywords

Centres of Maximal Disks; Digital Shape Representation; Look Up Tables; Medial Axis; Squared Euclidean Distance Transform

Indexed keywords

ALGORITHMS; DISTANCE MEASUREMENT; GEOMETRY; MATHEMATICAL TRANSFORMATIONS; MOBILE DEVICES;

DIGITAL SHAPES; LOOK UP TABLE; MAXIMAL DISKS; MEDIAL AXIS; SQUARED EUCLIDEAN DISTANCE;

TABLE LOOKUP;

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

References (18)

1. C. Arcelli and G. Sanniti di Baja. Finding local maxima in a pseudo-Euclidean distance transform. Comp. Vision, Graphics and Image Proc., 43:361-367, 1988.
2. H. Blum. A transformation for extracting new descriptors of shape. In W. Wathendunn, editor, Models for the Perception of Speech and Visual Form, pages 362-380, Cambridge, 1967. MIT Press.
3. th Scand. Conf. on Image Analysis, pages 105-111, Tromsø, Norway, 1993.
4. G. Borgefors and I. Nyström. Efficient shape representation by minimizing the set of centres of maximal discs/spheres. Pat. Rec. Letters, 18:465-472, 1997.
5. th Scand. Conf. on Image Analysis, volume 2, pages 974-981, Aalborg, Denmark, 1991.
6. P.E. Danielsson. Euclidean distance mapping. Comp. Graphics and Image Proc., 14:227-248, 1980.
7. G.H. Hardy and E.M. Wright. An introduction to the theory of numbers. Oxford University Press, fifth edition, October 1978.
8. T. Hirata. A unified linear-time algorithm for computing distance maps. Information Proc. Letters, 58:129-133, 1996.
9. A. Meijster, J.B.T.M. Roerdink, and W.H. Hesselink. A general algo. for comp. distance trans. in linear time. In Goutsias and Bloomberg, editors, Math. Morph. and its App. to Image and Signal Proc., pages 331-340. Kluwer, 2000.
10. F. Nilsson and P.E. Danielsson. Finding the minimal set of maximum disks for binary objects. Graph. Models and Image Proc., 59(1):55-60, 1997.
11. J.L. Pfaltz and A. Rosenfeld. Computer representation of planar regions by their skeletons. Comm. of ACM, 10:119-125, feb 1967.
12. I. Ragnemalm. The Euclidean distance transform in arbitrary dimensions. Pat. Rec. Letters, 14(11):883-888, 1993.
13. E. Remy. Normes de chanfrein et axe médian dans le volume discret. PhD, Univ. de la Méditerranée, Aix-Marseille 2, Dec 2001.
14. E. Remy and E. Thiel. Medial axis for chamfer distances: computing look-up tables and neighbourhoods in 2D or 3D. Pat. Rec. Letters, 23(6):649-661, April 2002.
15. A. Rosenfeld and J.L. Pfaltz. Sequential operations in digital picture processing. Journal of ACM, 13(4):471-494, 1966.
16. T. Saito and J.I. Toriwaki. New algorithms for Euclidean distance trans. of an n-dim, digitized picture with applications. Pat. Rec., 27(11):1551-1565, 1994.
17. G. Sanniti di Baja and E. Thiel. A skeletonization algorithm running on path-based distance maps. Image and Vision Computing, 14(1):47-57, Feb 1996.
18. ∼thiel/lidr .