{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T22:59:46Z","timestamp":1648594786555},"reference-count":13,"publisher":"Elsevier BV","issue":"13","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"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":[[1998,11]]},"DOI":"10.1016\/s0167-8655(98)00101-9","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T08:06:40Z","timestamp":1051258000000},"page":"1235-1240","source":"Crossref","is-referenced-by-count":5,"title":["Faster point set pattern matching in 3-D"],"prefix":"10.1016","volume":"19","author":[{"given":"Laurence","family":"Boxer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8655(98)00101-9_BIB1","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0097-3165(89)90032-0","article-title":"Sharp upper and lower bounds on the length of general Davenport\u2013Schinzel sequences","volume":"52","author":"Agarwal","year":"1989","journal-title":"Journal of Combinatorial Theory A"},{"key":"10.1016\/S0167-8655(98)00101-9_BIB2","unstructured":"Alt, H., Guibas, L.J., 1996. Discrete geometric shapes: matching, interpolation, and approximation. Report B 96-11, Institut f\u00fcr Informatik, Freie Universit\u00e4t, Berlin"},{"key":"10.1016\/S0167-8655(98)00101-9_BIB3","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1016\/0167-8191(92)90046-A","article-title":"Finding congruent regions in parallel","volume":"18","author":"Boxer","year":"1992","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8655(98)00101-9_BIB4","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1016\/0167-8655(96)00086-4","article-title":"Point set pattern matching in 3-D","volume":"17","author":"Boxer","year":"1996","journal-title":"Pattern Recognition Letters"},{"key":"10.1016\/S0167-8655(98)00101-9_BIB5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02187783","article-title":"Combinatorial complexity bounds for arrangements of curves and surfaces","volume":"5","author":"Clarkson","year":"1990","journal-title":"Discrete and Computational Geometry"},{"key":"10.1016\/S0167-8655(98)00101-9_BIB6","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF01293487","article-title":"Point set pattern matching in d-dimensions","volume":"13","author":"de Rezende","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-8655(98)00101-9_BIB7","doi-asserted-by":"crossref","first-page":"248","DOI":"10.2307\/2305092","article-title":"On a set of distances of n points","volume":"53","author":"Erd\u00f6s","year":"1946","journal-title":"American Mathematical Monthly"},{"key":"10.1016\/S0167-8655(98)00101-9_BIB8","unstructured":"Goodrich, M.T., Kravetz, D., 1992. Point set pattern matching. Department of Computer Science, Johns Hopkins University, Technical Report JHU-92\/11"},{"key":"10.1016\/S0167-8655(98)00101-9_BIB9","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0097-8493(92)90006-H","article-title":"A parallel algorithm for finding congruent regions","volume":"16","author":"Lei","year":"1992","journal-title":"Computers and Graphics"},{"key":"10.1016\/S0167-8655(98)00101-9_BIB10","doi-asserted-by":"crossref","unstructured":"Preparata, F.P., Shamos, M.I., 1985. Computational Geometry: An Introduction. Springer, New York","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"10.1016\/S0167-8655(98)00101-9_BIB11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0020-0190(92)90025-Q","article-title":"Approximate decision algorithms for approximate congruence","volume":"43","author":"Schirra","year":"1992","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0167-8655(98)00101-9_BIB12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0167-8191(90)90142-V","article-title":"A parallel algorithm for finding congruent regions","volume":"13","author":"Shih","year":"1990","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8655(98)00101-9_BIB13","unstructured":"Spencer, J., Szemeredi, E., Trotter, Jr., W.T., 1984. Unit distances in the Euclidean plane. In: Graph Theory and Combinatorics, Academic Press, London, pp. 293\u2013303"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865598001019?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865598001019?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T06:51:40Z","timestamp":1555570300000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865598001019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":13,"journal-issue":{"issue":"13","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0167865598001019"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8655(98)00101-9","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}