{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T05:21:24Z","timestamp":1768454484798,"version":"3.49.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":7321,"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":[[1993,7]]},"DOI":"10.1016\/0925-7721(93)90001-m","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:41:31Z","timestamp":1027640491000},"page":"59-89","source":"Crossref","is-referenced-by-count":25,"title":["A convex polygon among polygonal obstacles: placement and high-clearance motion"],"prefix":"10.1016","volume":"3","author":[{"given":"L.Paul","family":"Chew","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klara","family":"Kedem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(93)90001-M_BIB1","article-title":"The polygon containment problem: 1. Simultaneous containment under translation and rotation","author":"Avnaim","year":"1987"},{"key":"10.1016\/0925-7721(93)90001-M_BIB2","first-page":"322","article-title":"Polygon placement under translation and rotation","volume":"294","author":"Avnaim","year":"1988"},{"key":"10.1016\/0925-7721(93)90001-M_BIB3","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0097-3165(89)90032-0","article-title":"Sharp upper and lower bounds for the length of general Davenport\u2013Schinzel sequences","volume":"52","author":"Agarwal","year":"1989","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0925-7721(93)90001-M_BIB4","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1016\/0898-1221(85)90105-1","article-title":"Some dynamic computational geometry problems","volume":"11","author":"Atallah","year":"1985","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0925-7721(93)90001-M_BIB5","article-title":"The complexity of robot motion planning","author":"Canny","year":"1987"},{"key":"10.1016\/0925-7721(93)90001-M_BIB6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/323233.323264","article-title":"Voronoi diagrams based on convex distance functions","author":"Chew","year":"1985","journal-title":"Proc. First ACM Symposium on Computational Geometry"},{"key":"10.1016\/0925-7721(93)90001-M_BIB7","first-page":"1","article-title":"The polygon containment problem","volume":"Vol. I:","author":"Chazelle","year":"1983"},{"key":"10.1016\/0925-7721(93)90001-M_BIB8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01553881","article-title":"Constrained Delaunay Triangulations","volume":"4","author":"Chew","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(93)90001-M_BIB9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1145\/73833.73853","article-title":"Placing the largest similar copy of a convex polygon among polygonal obstacles","author":"Chew","year":"1989","journal-title":"Proc. Fifth ACM Symposium on Computational Geometry"},{"key":"10.1016\/0925-7721(93)90001-M_BIB10","first-page":"14853","article-title":"High-clearance motion planning for a convex polygon among polygonal obstacles","author":"Chew","year":"1990"},{"key":"10.1016\/0925-7721(93)90001-M_BIB11","first-page":"189","article-title":"Fast algorithms for polygon containment","volume":"194","author":"Fortune","year":"1985"},{"key":"10.1016\/0925-7721(93)90001-M_BIB12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","article-title":"A sweepline algorithm for Voronoi diagrams","volume":"2","author":"Fortune","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(93)90001-M_BIB13","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."},{"key":"10.1016\/0925-7721(93)90001-M_BIB14","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579170","article-title":"Non-linearity of Davenport\u2013Schinzel sequences and of generalized path compression schemes","volume":"6","author":"Hart","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0925-7721(93)90001-M_BIB15","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\/0925-7721(93)90001-M_BIB16","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02187779","article-title":"An efficient motion planning algorithm for a convex polygonal object in 2-dimensional space","volume":"5","author":"Kedem","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90001-M_BIB17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02187695","article-title":"Generalized Delaunay triangulation for planar graphs","volume":"1","author":"Lee","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90001-M_BIB18","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02187867","article-title":"Planning a purely translational motion for a convex polygonal object in two dimensional space using Generalized Voronoi diagrams","volume":"2","author":"Leven","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90001-M_BIB19","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 in two dimensional polygonal space","volume":"2","author":"Leven","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90001-M_BIB20","first-page":"77","article-title":"Geometric applications of Davenport\u2013Schinzel sequences","author":"Sharir","year":"1986","journal-title":"Proc. 27th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0925-7721(93)90001-M_BIB21","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1002\/cpa.3160390402","article-title":"Generalized Voronoi diagrams for moving a ladder: I. topological analysis","volume":"39","author":"O'Dunlaing","year":"1986","journal-title":"Comm. Pure Appl. Math."},{"key":"10.1016\/0925-7721(93)90001-M_BIB22","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01840348","article-title":"Generalized Voronoi diagrams for moving a ladder: II. efficient construction of the diagram","volume":"2","author":"O'Dunlaing","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(93)90001-M_BIB23","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0196-6774(85)90021-5","article-title":"the Voronoi diagram method for motion planning: the case of a disc","volume":"6","author":"O'Dunlaing","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(93)90001-M_BIB24","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1145\/109648.109668","article-title":"Extremal polygon containment problems","author":"Toledo","year":"1991","journal-title":"Proc. Seventh ACM Symposium on Computational Geometry"},{"key":"10.1016\/0925-7721(93)90001-M_BIB25","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","article-title":"An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments","volume":"2","author":"Yap","year":"1987","journal-title":"Discrete Comput. Geom."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390001M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390001M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:55:50Z","timestamp":1555124150000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219390001M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["092577219390001M"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(93)90001-m","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}