Computing distance transformations in convex and non-convex domains
- 1 January 1987
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 20 (6), 599-615
- https://doi.org/10.1016/0031-3203(87)90030-6
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Distance transformations in digital imagesComputer Vision, Graphics, and Image Processing, 1986
- Distances defined by neighborhood sequencesPattern Recognition, 1986
- Efficient implementation of skeletonisation using interval codingPattern Recognition Letters, 1985
- Distance transformations in arbitrary dimensionsComputer Vision, Graphics, and Image Processing, 1984
- A fast algorithm for cellular logic operations on sequential machinesPattern Recognition Letters, 1984
- On the Cellular Convexity of ComplexesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1981
- DIODA: Delineation and feature extraction of microscopical objectsComputer Programs in Biomedicine, 1979
- Digital Straight Line SegmentsIEEE Transactions on Computers, 1974
- A Method for Obtaining Skeletons Using a Quasi-Euclidean DistanceJournal of the ACM, 1968
- Sequential Operations in Digital Picture ProcessingJournal of the ACM, 1966