{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T15:10:26Z","timestamp":1681830626000},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"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":4034,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0925-7721(01)00022-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:31:49Z","timestamp":1027654309000},"page":"53-68","source":"Crossref","is-referenced-by-count":6,"title":["Models and motion planning"],"prefix":"10.1016","volume":"23","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[]},{"given":"Mark H.","family":"Overmars","sequence":"additional","affiliation":[]},{"given":"A.Frank","family":"van der Stappen","sequence":"additional","affiliation":[]},{"given":"Jules","family":"Vleugels","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(01)00022-0_BIB001","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0925-7721(95)00005-8","article-title":"Computing depth orders for fat objects and related problems","volume":"5","author":"Agarwal","year":"1995","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(01)00022-0_BIB002","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BF01758853","article-title":"Approximate motion planning and the complexity of the boundary of the union of simple geometric figures","volume":"8","author":"Alt","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(01)00022-0_BIB003","series-title":"Proc. IEEE Internat. Conf. Robot. Autom.","first-page":"1548","article-title":"Implementation and extension of the ladder algorithm","author":"Ba\u00f1on","year":"1990"},{"key":"10.1016\/S0925-7721(01)00022-0_BIB004","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\/S0925-7721(01)00022-0_BIB005","series-title":"Proc. 13th Annu. ACM Sympos. Comput. Geom.","first-page":"294","article-title":"Realistic input models for geometric algorithms","author":"de Berg","year":"1997"},{"key":"10.1016\/S0925-7721(01)00022-0_BIB006","unstructured":"M. de Berg, H. David, M.J. Katz, M. Overmars, A.F. van der Stappen, J. Vleugels, Guarding scenes against invasive hypercubes, Technical Report UU-CS-2000-40, Institute of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands, 2000"},{"key":"10.1016\/S0925-7721(01)00022-0_BIB007","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0925-7721(99)00036-X","article-title":"On the union of \u03ba-curved objects","volume":"14","author":"Efrat","year":"1999","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(01)00022-0_BIB008","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0925-7721(99)00059-0","article-title":"Dynamic data structures for fat objects and their applications","volume":"15","author":"Efrat","year":"2000","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(01)00022-0_BIB009","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":"Computational Geometry"},{"key":"10.1016\/S0925-7721(01)00022-0_BIB010","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0925-7721(92)90024-M","article-title":"Efficient hidden surface removal for objects with small union size","volume":"2","author":"Katz","year":"1992","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(01)00022-0_BIB011","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1137\/S009753979018330X","article-title":"Fat triangles determine linearly many holes","volume":"23","author":"Matou\u0161ek","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(01)00022-0_BIB012","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1142\/S021819599700020X","article-title":"Query-sensitive ray shooting","volume":"7","author":"Mitchell","year":"1997","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0925-7721(01)00022-0_BIB013","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"},{"key":"10.1016\/S0925-7721(01)00022-0_BIB014","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/cpa.3160360305","article-title":"On the \u201cpiano movers\u201d problem I: The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers","volume":"36","author":"Schwartz","year":"1983","journal-title":"Commun. Pure Appl. Math."},{"key":"10.1016\/S0925-7721(01)00022-0_BIB015","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0020-0190(96)00154-8","article-title":"Range searching in low-density environments","volume":"60","author":"Schwarzkopf","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(01)00022-0_BIB016","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0925-7721(93)90007-S","article-title":"The complexity of the free space for a robot moving amidst fat obstacles","volume":"3","author":"van der Stappen","year":"1993","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(01)00022-0_BIB017","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01258292","article-title":"The complexity of the free space for motion planning amidst fat obstacles","volume":"11","author":"van der Stappen","year":"1994","journal-title":"J. Intell. Robotic Syst."},{"key":"10.1016\/S0925-7721(01)00022-0_BIB018","doi-asserted-by":"crossref","unstructured":"A.F. van der Stappen, Motion planning amidst fat obstacles, Ph.D. Thesis, Department of Computer Science, Utrecht University, Utrecht, The Netherlands, 1994","DOI":"10.1145\/177424.177453"},{"key":"10.1016\/S0925-7721(01)00022-0_BIB019","series-title":"Proc. 10th Annu. ACM Sympos. Comput. Geom.","first-page":"31","article-title":"Motion planning amidst fat obstacles","author":"van der Stappen","year":"1994"},{"key":"10.1016\/S0925-7721(01)00022-0_BIB020","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/PL00009402","article-title":"Motion planning in environments with low obstacle density","volume":"20","author":"van der Stappen","year":"1998","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00022-0_BIB021","unstructured":"J. Vleugels, On fatness and fitness\u2014Realistic input models for geometric algorithms, Ph.D. Thesis, Department of Computer Science, Utrecht University, Utrecht, The Netherlands, 1997"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000220?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000220?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T14:34:56Z","timestamp":1681828496000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0925772101000220"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00022-0","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}