{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T14:52:35Z","timestamp":1648738355484},"reference-count":9,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1016\/0167-8191(93)90022-d","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"1129-1140","source":"Crossref","is-referenced-by-count":2,"title":["Parallel computation of the Hausdorff distance between images"],"prefix":"10.1016","volume":"19","author":[{"given":"Terry","family":"Bossomaier","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Loeff","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0167-8191(93)90022-D_BIB1","first-page":"215","article-title":"A better way to compress images","volume":"13","author":"Barnsley","year":"1988","journal-title":"BYTE Mag."},{"key":"10.1016\/0167-8191(93)90022-D_BIB2","series-title":"Fractals Everywhere","author":"Barnsley","year":"1988"},{"key":"10.1016\/0167-8191(93)90022-D_BIB3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(89)90114-2","article-title":"An image algorithm for computing the Hausdorff distance efficiently in linear time","volume":"30","author":"Shonkwiler","year":"1989","journal-title":"Informat. Processing Letters"},{"key":"10.1016\/0167-8191(93)90022-D_BIB4","series-title":"Proc. Australian Transputer and OCCAM User Group 1990","first-page":"1","article-title":"Parallel computation of the Hausdorff distance between sets","author":"Bossomaier","year":"1990"},{"issue":"3","key":"10.1016\/0167-8191(93)90022-D_BIB5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00977785","article-title":"Two algorithms for constructing a Delaunay triangulation","volume":"9","author":"Lee","year":"1980","journal-title":"Internat. J. Comput. Informat. Sci."},{"key":"10.1016\/0167-8191(93)90022-D_BIB6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01840383","article-title":"Parallel geometric algorithms on a mesh-connected computer","volume":"5","author":"Jeong","year":"1990","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/0167-8191(93)90022-D_BIB7","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1093\/comjnl\/21.2.168","article-title":"Computing Dirichlet tessellations in the plane","volume":"21","author":"Green","year":"1978","journal-title":"Comput. J."},{"key":"10.1016\/0167-8191(93)90022-D_BIB8","series-title":"Statistical Analysis of Spatial Point Patterns","author":"Diggle","year":"1983"},{"key":"10.1016\/0167-8191(93)90022-D_BIB9","series-title":"Hypercube Multiprocessors 1986","first-page":"244","article-title":"Concurrent computation and the theory of complex systems","author":"Fox","year":"1986"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390022D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390022D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:28:07Z","timestamp":1551086887000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919390022D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":9,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["016781919390022D"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(93)90022-d","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}