{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:40:53Z","timestamp":1758267653534},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0020-0190(01)00321-0","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"135-140","source":"Crossref","is-referenced-by-count":5,"title":["Walking around fat obstacles"],"prefix":"10.1016","volume":"83","author":[{"given":"L.Paul","family":"Chew","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haggai","family":"David","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klara","family":"Kedem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00321-0_BIB001","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s004530010047","article-title":"Linear size binary space partitions for uncluttered scenes","volume":"28","author":"de Berg","year":"2000","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(01)00321-0_BIB002","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"1997"},{"key":"10.1016\/S0020-0190(01)00321-0_BIB003","series-title":"Handbook of Discrete and Computational Geometry","first-page":"699","article-title":"Linear programming in low dimensions","author":"Dyer","year":"1997"},{"key":"10.1016\/S0020-0190(01)00321-0_BIB004","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0925-7721(96)00027-2","article-title":"3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting, amidst convex fat objects","volume":"8","author":"Katz","year":"1997","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0020-0190(01)00321-0_BIB005","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1006\/jagm.1996.0063","article-title":"Range searching and point location among fat objects","volume":"21","author":"Overmars","year":"1996","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/S0020-0190(01)00321-0_BIB006","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/BF01377181","article-title":"An optimal algorithm for the on-line closest-pair problem","volume":"12","author":"Schwartz","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(01)00321-0_BIB007","series-title":"Motion planning amidst fat obstacles, Ph.D. thesis","author":"van der Stappen","year":"1994"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003210?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003210?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T01:50:39Z","timestamp":1556848239000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001003210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0020019001003210"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00321-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}