Selected papers that cite this one
- Michael B. Dillencourt, Hannan Samet, and Markku Tamminen. A general approach to connected-component labeling for arbitrary image representations. Journal of the ACM, 39(2):253-280, April 1992.
- Tomio Hirata. A unified linear-time algorithm for computing distance maps. Information Processing Letters, 58(3):129-133, 13 May 1996.
- Ugo Montanari. Continuous skeletons from digitized images. Journal of the ACM, 16(4):534-549, October 1969.
- U. Montanari. A method for obtaining skeletons using a quasi-Euclidean distance. Journal of the ACM, 15(4):600-624, October 1968.
- Azriel Rosenfeld. Connectivity in digital pictures. Journal of the ACM, 17(1):146-160, January 1970.
- Stanley M. Selkow. One-pass complexity of digital picture properties. Journal of the ACM, 19(2):283-295, April 1972.
- R. Stefanelli and A. Rosenfeld. Some parallel thinning algorithms for digital pictures. Journal of the ACM, 18(2):255-264, April 1971.
Selected references
- R. Narasimhan. Labeling schemata and synctactic descriptions of pictures. Information and Control, 7(2):151-179, June 1964.