{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T07:11:25Z","timestamp":1673421085211},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5221,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1016\/s0166-218x(99)00008-6","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"89-108","source":"Crossref","is-referenced-by-count":7,"title":["Relocalization \u2014 theory and practice"],"prefix":"10.1016","volume":"93","author":[{"given":"Oliver","family":"Karch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Wahl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00008-6_BIB1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01530830","article-title":"Approximate matching of polygonal shapes","volume":"13","author":"Alt","year":"1995","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/S0166-218X(99)00008-6_BIB2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/34.75509","article-title":"An efficiently computable metric for comparing polygonal shapes","volume":"13","author":"Arkin","year":"1991","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"10.1016\/S0166-218X(99)00008-6_BIB3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/70.75902","article-title":"Blanche-an experiment in guidance and navigation of an autonomous robot vehicle","volume":"7","author":"Cox","year":"1991","journal-title":"IEEE Trans. Robot. Automat."},{"key":"10.1016\/S0166-218X(99)00008-6_BIB4","series-title":"Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms","first-page":"437","article-title":"Localizing a robot with minimum travel","author":"Dudek","year":"1995"},{"key":"10.1016\/S0166-218X(99)00008-6_BIB5","series-title":"Algorithmic Foundations of Robotics A.K. Peters","first-page":"269","article-title":"The robot localization problem","author":"Guibas","year":"1995"},{"key":"10.1016\/S0166-218X(99)00008-6_BIB6","article-title":"A sharper complexity bound for the robot localization problem","author":"Karch","year":"1996"},{"key":"10.1016\/S0166-218X(99)00008-6_BIB7","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/204865.204889","article-title":"LEDA \u2014 a platform for combinatorial and geometric computing","volume":"38","author":"Mehlhorn","year":"1995","journal-title":"Commun. ACM"},{"key":"10.1016\/S0166-218X(99)00008-6_BIB8","first-page":"211","article-title":"A data structure for representing and efficient querying large scenes of geometric objects: MB\u2217-trees","volume":"vol. 8","author":"Noltemeier","year":"1993"},{"key":"10.1016\/S0166-218X(99)00008-6_BIB9","series-title":"13th European Workshop on Computational Geometry (CG '97)","first-page":"20","article-title":"Efficient robot self-localization in simple polygons","author":"Schuierer","year":"1997"},{"key":"10.1016\/S0166-218X(99)00008-6_BIB10","article-title":"Distance functions for polygons and their application to robot localization (in German)","author":"Wahl","year":"1997"},{"key":"10.1016\/S0166-218X(99)00008-6_BIB11","series-title":"Autonomous Robot Vehicles","article-title":"Location estimation and uncertainty analysis for mobile robots","author":"Wang","year":"1990"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000086?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000086?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:27:50Z","timestamp":1556666870000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99000086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0166218X99000086"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00008-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}