{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:52:21Z","timestamp":1765039941967},"reference-count":18,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":[[1991,1]]},"DOI":"10.1016\/0031-3203(91)90045-7","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:41:01Z","timestamp":1056998461000},"page":"775-781","source":"Crossref","is-referenced-by-count":20,"title":["Computing some distance functions between polygons"],"prefix":"10.1016","volume":"24","author":[{"given":"Mikhail J.","family":"Atallah","sequence":"first","affiliation":[]},{"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[]},{"given":"Sergio","family":"Lifschitz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0031-3203(91)90045-7_BIB1","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0167-8655(89)90061-5","article-title":"Optimal matching of convex polygons","volume":"9","author":"Cox","year":"1989","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0031-3203(91)90045-7_BIB2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0020-0190(83)90042-X","article-title":"A linear time algorithm for the Hausdorff distance between convex polygons","volume":"17","author":"Atallah","year":"1983","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0031-3203(91)90045-7_BIB3","series-title":"Convex Polytopes","author":"Grunbaum","year":"1967"},{"key":"10.1016\/0031-3203(91)90045-7_BIB4","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/0146-664X(82)90023-5","article-title":"A new linear time algorithm for intersecting convex polygons","volume":"19","author":"O'Rourke","year":"1982","journal-title":"Comput. Graphics Image Process"},{"key":"10.1016\/0031-3203(91)90045-7_BIB5","article-title":"A linear time algorithm for the computation of some distance functions between convex polygons","author":"Ribeiro","year":"1990"},{"key":"10.1016\/0031-3203(91)90045-7_BIB6","series-title":"Proc. 14th ACM Symp. Theory Computation","first-page":"231","article-title":"Bounds on the time for parallel RAMs to compute simple functions","author":"Cook","year":"1982"},{"key":"10.1016\/0031-3203(91)90045-7_BIB7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/0031-3203(91)90045-7_BIB8","article-title":"An EREW-PRAM algorithm for the convex hull of a sorted point set","author":"Chen","year":"1989"},{"key":"10.1016\/0031-3203(91)90045-7_BIB9","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0031-3203(91)90045-7_BIB10","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0218014","article-title":"Adaptive bitonic sorting: an optimal parallel algorithm for shared-memory machines","volume":"18","author":"Bilardi","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0031-3203(91)90045-7_BIB11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(89)90138-5","article-title":"Optimal merging and sorting on the EREW PRAM","volume":"33","author":"Hagerup","year":"1989","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0031-3203(91)90045-7_BIB12","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","article-title":"Maintenance of configurations in the plane","volume":"23","author":"Overmars","year":"1981","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0031-3203(91)90045-7_BIB13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","article-title":"Triangulating a simple polygon","volume":"7","author":"Garey","year":"1978","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0031-3203(91)90045-7_BIB14","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","article-title":"An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments","volume":"2","author":"Yap","year":"1987","journal-title":"Discrete Computational Geometry"},{"key":"10.1016\/0031-3203(91)90045-7_BIB15","series-title":"Proc. 30th Ann. IEEE Symp. Foundations Comput. Sci.","first-page":"586","article-title":"An optimal algorithm for intersecting three-dimensional convex polyhedra","author":"Chazelle","year":"1989"},{"key":"10.1016\/0031-3203(91)90045-7_BIB16","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(82)90120-7","article-title":"Fast detection of polyhedral intersection","volume":"27","author":"Dobkin","year":"1983","journal-title":"Theoretical Comput. Sci."},{"key":"10.1016\/0031-3203(91)90045-7_BIB17","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0196-6774(85)90007-0","article-title":"A linear algorithm for determining the separation of convex polyhedra","volume":"6","author":"Dobkin","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0031-3203(91)90045-7_BIB18","series-title":"Proc. 6th Ann. ACM Symp. Computational Geometry","first-page":"340","article-title":"Computing the minimum Hausdorff distance for point sets under translation","author":"Huttenlocher","year":"1990"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320391900457?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320391900457?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:54:17Z","timestamp":1552906457000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0031320391900457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":18,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0031320391900457"],"URL":"https:\/\/doi.org\/10.1016\/0031-3203(91)90045-7","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}