{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:09Z","timestamp":1725663369280},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540507284"},{"type":"electronic","value":"9783540460763"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50728-0_44","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:32:10Z","timestamp":1330183930000},"page":"202-212","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Separating a polyhedron by one translation from a set of obstacles"],"prefix":"10.1007","author":[{"given":"Otto","family":"Nurmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg-R.","family":"Sack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"G. Davis, Computing separating planes for a pair of disjoint polytopes. Proc. 1st ACM Symp. Computational Geometry, 1985, 8\u201314.","DOI":"10.1145\/323233.323235"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF01952829","volume":"3","author":"F. Dehne","year":"1987","unstructured":"F. Dehne, and J.-R. Sack, Translation separability of sets of polygons. Visual Computer\n3 (1987), 227\u2013235.","journal-title":"Visual Computer"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"L. Guibas, L. Ramshaw, and J. Stolfi, A kinetic framework for computational geometry. Proc. 24th IEEE Symp. Foundations of Computer Science 1983, 100\u2013111.","DOI":"10.1109\/SFCS.1983.1"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"K. Kedem, and M. Sharir, An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles. Proc. 1st ACM Symp. Computational Geometry, 1985, 75\u201380.","DOI":"10.1145\/323233.323244"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. G. Kirkpatrick","year":"1983","unstructured":"D. G. Kirkpatrick, Optimal search in planar subdivisions. SIAM J. Comput.\n12 (1983), 28\u201335.","journal-title":"SIAM J. Comput."},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T. Lozano-Perez","year":"1979","unstructured":"T. Lozano-Perez, and M. Wesley, An algorithm for planning collision-free paths among polyhedral obstacles. Communications of the ACM\n22 (1979), 560\u2013570.","journal-title":"Communications of the ACM"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"S. Maddila, and C.K. Yap, Moving a polygon around the corner in a corridor. Proc. 2nd ACM Symp. Computational Geometry, 1986, 187\u2013192.","DOI":"10.1145\/10515.10536"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"M. McKenna, and R. Seidel, Finding the optimal shadows of a convex polytope. Proc. 1st ACM Symp. Computational Geometry, 1985, 24\u201328.","DOI":"10.1145\/323233.323237"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, Linear time algorithm for linear programming in R3 and related problems. SIAM J. Comput.\n12 (1983), 759\u2013776.","journal-title":"SIAM J. Comput."},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0734-189X(85)90159-8","volume":"30","author":"T. Ottmann","year":"1985","unstructured":"Th. Ottmann, P. Widmayer, and D. Wood, A fast algorithm for boolean masking problem. Comput. Vision Graphics Image Process.\n30 (1985), 249\u2013268.","journal-title":"Comput. Vision Graphics Image Process."},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","volume":"20","author":"F. P. Preparata","year":"1977","unstructured":"F. P. Preparata, and S. J. Hong, Convex hulls of finite sets of points in two and three dimensions. Communications of the ACM\n20 (1977), 87\u201393.","journal-title":"Communications of the ACM"},{"key":"13_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry. An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata, and M. I. Shamos, Computational Geometry. An Introduction. Springer-Verlag, New York etc., 1985."},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1002\/cpa.3160370605","volume":"XXXVII","author":"J. T. Schwartz","year":"1984","unstructured":"J. T. Schwartz, and M. Sharir, On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles. Comm. Pure Appl. Math. Vol. XXXVII (1984), 815\u2013848.","journal-title":"Comm. Pure Appl. Math."},{"key":"13_CR14","unstructured":"H. Seeland, CAD-Abteilung, Daimler Benz AG, Stuttgart, Personal communication, 1987."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"M. Sharir, and A. Baltsan, On shortest path amidst convex polyhedra. Proc. 2nd ACM Symp. Computational Geometry, 1986, 193\u2013206.","DOI":"10.1145\/10515.10537"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"M. Sharir, R. Cole, K. Kadem, D. Leven, and R. Pollack, Geometric appications of Davenport-Schinzel sequences. Proc. 27th IEEE Symp. Foundations of Computer Science, 1986, 77\u201386.","DOI":"10.1109\/SFCS.1986.23"},{"key":"13_CR17","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/B978-0-444-87806-9.50018-9","volume-title":"Computational Geometry","author":"G. T. Toussaint","year":"1985","unstructured":"G. T. Toussaint, Movable separability of sets. In: G. T. Toussaint (ed.), Computational Geometry, North-Holland, Amsterdam etc., 1985, 335\u2013376."},{"key":"13_CR18","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/B978-0-444-87806-9.50019-0","volume-title":"Computational Geometry","author":"S. H. Whitesides","year":"1985","unstructured":"S. H. Whitesides, Computational geometry and spatial planning. In: G. T. Toussaint (ed.), Computational Geometry, North-Holland, Amsterdam etc., 1985, 377\u2013428."},{"key":"13_CR19","unstructured":"C.K. Yap, How to move a chair through a door. Technical Report, Courant Institute, 1984."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50728-0_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:52:03Z","timestamp":1578509523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50728-0_44"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540507284","9783540460763"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-50728-0_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}