{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T17:44:55Z","timestamp":1649094295514},"reference-count":15,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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 Letters"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0167-8655(91)90410-n","type":"journal-article","created":{"date-parts":[[2005,1,5]],"date-time":"2005-01-05T07:28:33Z","timestamp":1104910113000},"page":"273-278","source":"Crossref","is-referenced-by-count":1,"title":["View angle transformations"],"prefix":"10.1016","volume":"12","author":[{"given":"Erwin R.","family":"Komen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8655(91)90410-N_bib1","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0146-664X(80)90054-4","article-title":"Euclidean distance mapping","volume":"14","author":"Danielsson","year":"1980","journal-title":"Computer Graphics and Image Processing"},{"key":"10.1016\/0167-8655(91)90410-N_bib2","series-title":"Proc. 6th Aachen Symposium on Signal Theory","first-page":"269","article-title":"Distance transform with dataflow techniques","author":"Dekker","year":"1987"},{"key":"10.1016\/0167-8655(91)90410-N_bib3","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\/0167-8655(91)90410-N_bib4","article-title":"Low-level image processing architectures: compared for some non-linear recursive neighbourhood operations","author":"Komen","year":"1990","journal-title":"Thesis"},{"issue":"4","key":"10.1016\/0167-8655(91)90410-N_bib5","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":"Montenari","year":"1968","journal-title":"J. ACM"},{"key":"10.1016\/0167-8655(91)90410-N_bib6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0167-8655(83)90026-0","article-title":"Paths and distance functions on three-dimensional digitized pictures","volume":"1","author":"Okabe","year":"1983","journal-title":"Pattern Recognition Letters"},{"issue":"6","key":"10.1016\/0167-8655(91)90410-N_bib7","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/0031-3203(87)90030-6","article-title":"Computing distance transformations in convex and non-convex domains","volume":"20","author":"Piper","year":"1987","journal-title":"Pattern Recognition"},{"key":"10.1016\/0167-8655(91)90410-N_bib8","first-page":"379","article-title":"The Euclidean distance transform and its implementation on SIMD architectures","author":"Ragnemalm","year":"1989"},{"key":"10.1016\/0167-8655(91)90410-N_bib9","series-title":"Progress in Image Analysis and Processing","first-page":"204","article-title":"Contour processing distance transforms","author":"Ragnemalm","year":"1990"},{"issue":"1","key":"10.1016\/0167-8655(91)90410-N_bib10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0031-3203(68)90013-7","article-title":"Distance functions in digital pictures","volume":"1","author":"Rosenfeld","year":"1968","journal-title":"Pattern Recognition"},{"key":"10.1016\/0167-8655(91)90410-N_bib11","series-title":"Skeletonization and distance transformation by greyscale morphology","author":"Shih","year":"1987"},{"key":"10.1016\/0167-8655(91)90410-N_bib12","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/0167-8655(90)90102-8","article-title":"Shading from shape, the eikonal equation solved by grey-weighted distance transform","volume":"11","author":"Verbeek","year":"1990","journal-title":"Pattern Recognition Letters"},{"issue":"4","key":"10.1016\/0167-8655(91)90410-N_bib13","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/34.19041","article-title":"An efficient uniform cost algorithm applied to distance transforms","volume":"11","author":"Verwer","year":"1989","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/0167-8655(91)90410-N_bib14","first-page":"495","article-title":"The signed euclidean distance transform and its applications","author":"Ye","year":"1988","journal-title":"IEEE CSP"},{"key":"10.1016\/0167-8655(91)90410-N_bib15","series-title":"Real-Time\/Parallel Computers: Image Processing","first-page":"73","article-title":"Theoretical considerations on a family of distance transformations and their applications","author":"Yokoi","year":"1981"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559190410N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559190410N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T06:50:30Z","timestamp":1548831030000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016786559190410N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["016786559190410N"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(91)90410-n","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}