{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T06:12:34Z","timestamp":1759385554716},"reference-count":14,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[1987]]},"DOI":"10.1016\/0031-3203(87)90030-6","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:41:01Z","timestamp":1056998461000},"page":"599-615","source":"Crossref","is-referenced-by-count":102,"title":["Computing distance transformations in convex and non-convex domains"],"prefix":"10.1016","volume":"20","author":[{"given":"Jim","family":"Piper","sequence":"first","affiliation":[]},{"given":"Erik","family":"Granum","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0031-3203(87)90030-6_BIB1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1145\/321356.321357","article-title":"Sequential operations in digital picture processing","volume":"13","author":"Rosenfeld","year":"1966","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/0031-3203(87)90030-6_BIB2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0734-189X(84)90035-5","article-title":"Distance transformations in arbitrary dimensions","volume":"27","author":"Borgefors","year":"1984","journal-title":"Comput. Vision Graphics Image Process."},{"key":"10.1016\/0031-3203(87)90030-6_BIB3","series-title":"Proc. 4th Int. Joint Conf. Pattern Recognition","first-page":"657","article-title":"Expanding picture components to natural density boundaries by propagation methods. The notions of fall-set and fall-distance","author":"Rutovitz","year":"1978"},{"key":"10.1016\/0031-3203(87)90030-6_BIB4","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1145\/321479.321486","article-title":"A method for obtaining skeletons using a quasi-Euclidean distance","volume":"15","author":"Montanari","year":"1968","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/0031-3203(87)90030-6_BIB5","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/S0734-189X(86)80047-0","article-title":"Distance transformations in digital images","volume":"34","author":"Borgefors","year":"1986","journal-title":"Comput. Vision Graphics Image Process."},{"issue":"3","key":"10.1016\/0031-3203(87)90030-6_BIB6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0031-3203(86)90014-2","article-title":"Distances defined by neighbourhood sequences","volume":"19","author":"Yamashita","year":"1986","journal-title":"Pattern Recognition"},{"key":"10.1016\/0031-3203(87)90030-6_BIB7","series-title":"Signal Processing III: Theories and Applications","first-page":"917","article-title":"The constrained distance transformation: a pseudo-Euclidean, recursive implementation of the Lee algorithm","author":"Dorst","year":"1986"},{"key":"10.1016\/0031-3203(87)90030-6_BIB8","series-title":"Pictorial Pattern Recognition","first-page":"105","article-title":"Data structures for operations on digital images","author":"Rutovitz","year":"1968"},{"key":"10.1016\/0031-3203(87)90030-6_BIB9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0010-468X(79)90072-2","article-title":"DIODA: delineation and feature extraction of microscopical objects","volume":"10","author":"Vossepoel","year":"1979","journal-title":"Comp. Prog. Biomedicine"},{"key":"10.1016\/0031-3203(87)90030-6_BIB10","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1109\/TPAMI.1981.4767162","article-title":"On the cellular convexity of complexes","author":"Kim","year":"1981","journal-title":"IEEE Trans. PAMI-3"},{"key":"10.1016\/0031-3203(87)90030-6_BIB11","doi-asserted-by":"crossref","first-page":"1264","DOI":"10.1109\/T-C.1974.223845","article-title":"Digital straight line segments","author":"Rosenfeld","year":"1974","journal-title":"IEEE Trans. Computing C-23"},{"key":"10.1016\/0031-3203(87)90030-6_BIB12","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0167-8655(84)90021-7","article-title":"A fast algorithm for cellular logic operations on sequential machines","volume":"2","author":"Groen","year":"1984","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0031-3203(87)90030-6_BIB13","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0167-8655(85)90025-X","article-title":"Efficient implementation of skeletonisation using interval coding","volume":"3","author":"Piper","year":"1985","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0031-3203(87)90030-6_BIB14","unstructured":"P.W. Verbeek, personal communication."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320387900306?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320387900306?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T10:23:32Z","timestamp":1552904612000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0031320387900306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1987]]}},"alternative-id":["0031320387900306"],"URL":"https:\/\/doi.org\/10.1016\/0031-3203(87)90030-6","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}