{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:00:04Z","timestamp":1725465604323},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646822"},{"type":"electronic","value":"9783540691068"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054357","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T03:43:28Z","timestamp":1149651808000},"page":"83-94","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Models and motion planning"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Overmars","sequence":"additional","affiliation":[]},{"given":"A.","family":"Frank van der Stappen","sequence":"additional","affiliation":[]},{"given":"Jules","family":"Vleugels","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0925-7721(95)00005-8","volume":"5","author":"P. K. Agarwal","year":"1995","unstructured":"Pankaj K. Agarwal, M. J. Katz, and M. Sharir. Computing depth orders and related problems. Comput. Geom. Theory Appl., 5:187\u2013206, 1995.","journal-title":"Comput. Geom. Theory Appl."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/BF01758853","volume":"8","author":"H. Alt","year":"1992","unstructured":"H. Alt, R. Fleischer, M. Kaufmann, K. Mehlhorn, S. N\u00c4her, S. Schirra, and C. Uhrig. Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. Algorithmica, 8:391\u2013406, 1992.","journal-title":"Algorithmica"},{"key":"8_CR3","unstructured":"J. M. Ba\u00f1on. Implementation and extension of the ladder algorithm. In Proc. IEEE Internat. Conf. Robot. Autom., pages 1548\u20131553, 1990."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"M. de Berg, M. J. Katz, A. F. van der Stappen, and J. Vleugels. Realistic input models for geometric algorithms. To appear; a preliminary version appeared in Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 294\u2013303, 1997.","DOI":"10.1145\/262839.262986"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Mark de Berg. Linear size binary space partitions for fat objects. In Proc. 3rd Annu. European Sympos. Algorithms, volume 979 of Lecture Notes Comput. Sci., pages 252\u2013263. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60313-1_148"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"A. Efrat and M. J. Katz. On the union of \u03ba-curved objects. In Proc. 14th Annu. ACM Sympos. Comput. Geom., 1998. to appear.","DOI":"10.1145\/276884.276908"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"A. Efrat, M. J. Katz, F. Nielsen, and M. Sharir. Dynamic data structures for fat objects and their applications. In Proc. 5th Workshop Algorithms Data Struct., pages 297\u2013306, 1997.","DOI":"10.1007\/3-540-63307-3_69"},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0925-7721(96)00027-2","volume":"8","author":"M. J. Katz","year":"1997","unstructured":"M. J. Katz. 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects. Comput. Geom. Theory Appl., 8:299\u2013316, 1997.","journal-title":"Comput. Geom. Theory Appl."},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0925-7721(92)90024-M","volume":"2","author":"M. J. Katz","year":"1992","unstructured":"M. J. Katz, M. H. Overmars, and M. Sharir. Efficient hidden surface removal for objects with small union size. Comput. Geom. Theory Appl., 2:223\u2013234, 1992.","journal-title":"Comput. Geom. Theory Appl."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"J. Matou\u0161ek. Epsilon-nets and computational geometry. In J. Pach, editor, New Trends in Discrete and Computational Geometry, volume 10 of Algorithms and Combinatorics, pages 69\u201389. Springer-Verlag, 1993.","DOI":"10.1007\/978-3-642-58043-7_4"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1137\/S009753979018330X","volume":"23","author":"J. Matou\u0161ek","year":"1994","unstructured":"J. Matou\u0161ek, J. Pach, M. Sharir, S. Sifrony, and E. Welzl. Fat triangles determine linearly many holes. SIAM J. Comput., 23:154\u2013169, 1994.","journal-title":"SIAM J. Comput."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"J. S. B. Mitchell, D. M. Mount, and S. Suri. Query-sensitive ray shooting. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 359\u2013368, 1994.","DOI":"10.1145\/177424.178094"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1006\/jagm.1996.0063","volume":"21","author":"M. H. Overmars","year":"1996","unstructured":"M. H. Overmars and A. F. van der Stappen. Range searching and point location among fat objects. J. Algorithms, 21:629\u2013656, 1996.","journal-title":"J. Algorithms"},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/cpa.3160360305","volume":"36","author":"J. T. Schwartz","year":"1983","unstructured":"J. T. Schwartz and M. Sharir. On the \u201cpiano movers\u201d problem I: the case of a two-dimensional rigid polygonal body moving amidst polygonal barriers. Commun. Pure Appl. Math., 36:345\u2013398, 1983.","journal-title":"Commun. Pure Appl. Math."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0020-0190(96)00154-8","volume":"60","author":"O. Schwarzkopf","year":"1996","unstructured":"Otfried Schwarzkopf and Jules Vleugels. Range searching in low-density environments. Inform. Process. Lett., 60:121\u2013127, 1996.","journal-title":"Inform. Process. Lett."},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0925-7721(93)90007-S","volume":"3","author":"A. F. van der Stappen","year":"1993","unstructured":"A. F. van der Stappen, D. Halperin, and M. H. Overmars. The complexity of the free space for a robot moving amidst fat obstacles. Comput. Geom. Theory Appl., 3:353\u2013373, 1993.","journal-title":"Comput. Geom. Theory Appl."},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"A. F. van der Stappen and M. H. Overmars. Motion planning amidst fat obstacles. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 31\u201340, 1994.","DOI":"10.1145\/177424.177453"},{"volume-title":"Report UU-CS-1997-19","year":"1997","author":"A. F. van der Stappen","key":"8_CR18","unstructured":"A. F. van der Stappen, M. H. Overmars, M. de Berg, and J. Vleugels. Motion planning in environments with low obstacle density. Report UU-CS-1997-19, Dept. Comput. Sci., Utrecht Univ., Utrecht, Netherlands, 1997."},{"volume-title":"Ph.d. thesis","year":"1997","author":"J. Vleugels","key":"8_CR19","unstructured":"Jules Vleugels. On Fatness and Fitness\u2014Realistic Input Models for Geometric Algorithms. Ph.d. thesis, Dept. Comput. Sci., Utrecht Univ., Utrecht, the Netherlands, March 1997."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'98"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T18:24:43Z","timestamp":1676658283000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646822","9783540691068"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0054357","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"26 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}