{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T11:41:09Z","timestamp":1760355669597,"version":"build-2065373602"},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1998,6,18]],"date-time":"1998-06-18T00:00:00Z","timestamp":898128000000},"content-version":"vor","delay-in-days":137,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0925-7721(97)00030-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T15:57:07Z","timestamp":1051113427000},"page":"181-196","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Combinatorial complexity of translating a box in polyhedral 3-space"],"prefix":"10.1016","volume":"9","author":[{"given":"Dan","family":"Halperin","sequence":"first","affiliation":[]},{"given":"Chee-Keng","family":"Yap","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(97)00030-8_BIB1","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF02574371","article-title":"Castles in the air revisited","volume":"12","author":"Aronov","year":"1994","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(97)00030-8_BIB2","series-title":"Proc. 10th Symposium on Computational Geometry","first-page":"21","article-title":"On translational motion planning in 3-space","author":"Aronov","year":"1994"},{"key":"10.1016\/S0925-7721(97)00030-8_BIB3","unstructured":"B. Aronov, M. Sharir, B. Tagansky, The union of convex polyhedra in three dimensions, SIAM J. Comput., to appear."},{"issue":"2","key":"10.1016\/S0925-7721(97)00030-8_BIB4","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0925-7721(93)90001-M","article-title":"A convex polygon among polygonal obstacles: placement and high-clearance motion","volume":"3","author":"Chew","year":"1993","journal-title":"Computational Geometry: Theory and Applications"},{"key":"10.1016\/S0925-7721(97)00030-8_BIB5","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/BF02187744","article-title":"On the general motion planning problem with two degrees of freedom","volume":"4","author":"Guibas","year":"1989","journal-title":"Discrete Comput. Geom."},{"article-title":"Algorithmic motion planning via arrangements of curves and of surfaces","year":"1992","author":"Halperin","key":"10.1016\/S0925-7721(97)00030-8_BIB6"},{"key":"10.1016\/S0925-7721(97)00030-8_BIB7","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02570714","article-title":"Almost tight upper bounds for the single cell and zone problems in three dimensions","volume":"14","author":"Halperin","year":"1995","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(97)00030-8_BIB8","series-title":"Proc. 9th ACM Symposium on Computational Geometry","first-page":"29","article-title":"Combinatorial complexity of translating a box in polyhedral 3-space","author":"Halperin","year":"1993"},{"key":"10.1016\/S0925-7721(97)00030-8_BIB9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579170","article-title":"Nonlinearity of Davenport-Schinzel sequences and of generalized path-compression schemes","volume":"6","author":"Hart","year":"1986","journal-title":"Combinatorica"},{"article-title":"An algorithm for moving a ladder in three dimensions","year":"1987","author":"Ke","key":"10.1016\/S0925-7721(97)00030-8_BIB10"},{"key":"10.1016\/S0925-7721(97)00030-8_BIB11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02187683","article-title":"On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles","volume":"1","author":"Kedem","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(97)00030-8_BIB12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02187779","article-title":"An efficient motion planning algorithm for a convex polygonal object in two-dimensional polygonal space","volume":"5","author":"Kedem","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(97)00030-8_BIB13","series-title":"Proc. 5th Canadian Conference on Computational Geometry","first-page":"204","article-title":"On critical orientations in the Kedem-Sharir motion planning algorithm for a convex polygon in the plane","author":"Kedem","year":"1993"},{"year":"1991","series-title":"Robot Motion Planning","author":"Latombe","key":"10.1016\/S0925-7721(97)00030-8_BIB14"},{"key":"10.1016\/S0925-7721(97)00030-8_BIB15","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF02187883","article-title":"On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space","volume":"2","author":"Leven","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(97)00030-8_BIB16","series-title":"Proceedings of the IEEE International Conference on Robotics and Automation","first-page":"1326","article-title":"Efficient algorithms for planning purely translational collision-free motion in two and three dimensions","author":"Sharir","year":"1987"},{"key":"10.1016\/S0925-7721(97)00030-8_BIB17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/2.16221","article-title":"Algorithmic motion planning in robotics","volume":"22","author":"Sharir","year":"1989","journal-title":"Computer"},{"key":"10.1016\/S0925-7721(97)00030-8_BIB18","first-page":"95","article-title":"Algorithmic motion planning","author":"Yap","year":"1987"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000308?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000308?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T11:00:58Z","timestamp":1760353258000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772197000308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0925772197000308"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(97)00030-8","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[1998,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Combinatorial complexity of translating a box in polyhedral 3-space","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0925-7721(97)00030-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}