{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:43:59Z","timestamp":1770741839790,"version":"3.49.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"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":6986,"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":[[1994,6]]},"DOI":"10.1016\/0925-7721(94)90011-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:41:31Z","timestamp":1027654891000},"page":"99-118","source":"Crossref","is-referenced-by-count":31,"title":["External polygon containment problems"],"prefix":"10.1016","volume":"4","author":[{"given":"Micha","family":"Sharir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sivan","family":"Toledo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(94)90011-6_BIB1","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0097-3165(89)90032-0","article-title":"Sharp upper and lower bounds on the lenght of general Davenport-Schinzel sequences","volume":"52","author":"Agarwal","year":"1989","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0925-7721(94)90011-6_BIB2","first-page":"72","article-title":"Applications of parametric searching in geometric optimization","author":"Agarwal","year":"1992","journal-title":"Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms"},{"key":"10.1016\/0925-7721(94)90011-6_BIB3","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01762120","article-title":"Parallel computational geometry","volume":"3","author":"Aggarwal","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(94)90011-6_BIB4","article-title":"The polygon containment problem: 1. Simultaneous containment under translation","author":"Avnaim","year":"1987"},{"key":"10.1016\/0925-7721(94)90011-6_BIB5","first-page":"322","article-title":"Polygon placement under translation and rotation","author":"Avnaim","year":"1988"},{"key":"10.1016\/0925-7721(94)90011-6_BIB6","first-page":"1","article-title":"The polygon containment problem","author":"Chazelle","year":"1983"},{"key":"10.1016\/0925-7721(94)90011-6_BIB7","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(86)90025-5","article-title":"Reporting and counting segment intersections","volume":"32","author":"Chazelle","year":"1986","journal-title":"J. Comp. Sys. Sci."},{"key":"10.1016\/0925-7721(94)90011-6_BIB8","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0221041","article-title":"An optimal algorithm for intersecting three-dimensional convex polyhedra","volume":"21","author":"Chazelle","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(94)90011-6_BIB9","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":"Comput. Geom. Theory Appl."},{"key":"10.1016\/0925-7721(94)90011-6_BIB10","first-page":"511","article-title":"Parallel merge sort","author":"Cole","year":"1986","journal-title":"27th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0925-7721(94)90011-6_BIB11","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/7531.7537","article-title":"Slowing down sorting networks to obtain faster sorting algorithms","volume":"34","author":"Cole","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0925-7721(94)90011-6_BIB12","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0925-7721(94)90011-6_BIB13","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0215023","article-title":"Optimal point location in a monotone subdivision","volume":"15","author":"Edelsbrunner","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(94)90011-6_BIB14","first-page":"189","article-title":"Fast algorithms for polygon containment","author":"Fortune","year":"1985"},{"key":"10.1016\/0925-7721(94)90011-6_BIB15","first-page":"100","article-title":"A kinetic framework for computational geometry","author":"Guibas","year":"1983","journal-title":"24th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0925-7721(94)90011-6_BIB16","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"},{"key":"10.1016\/0925-7721(94)90011-6_BIB17","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\/0925-7721(94)90011-6_BIB18","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","journal-title":"Proc. 5th Canadian Conference on Computational Geometry"},{"key":"10.1016\/0925-7721(94)90011-6_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-dimentional polygonal space","volume":"2","author":"Leven","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(94)90011-6_BIB20","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02187867","article-title":"Planning a purely translational motion for a convex 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(94)90011-6_BIB21","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","article-title":"Applying parallel computation in the design of serial algorithms","volume":"30","author":"Megiddo","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0925-7721(94)90011-6_BIB22","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","article-title":"Linear-time algorithms for linear programming in R3 and related problems","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(94)90011-6_BIB23","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","article-title":"Linear programming in linear time when the dimension is fixed","volume":"31","author":"Megiddo","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0925-7721(94)90011-6_BIB24","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0196-6774(86)90033-7","article-title":"Point retrieval for polygons","volume":"7","author":"Paterson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(94)90011-6_BIB25","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0196-8858(83)90014-3","article-title":"On the Piano Movers Problem: II. General techniques for computing topological properties of real algebraic manifolds","volume":"4","author":"Schwartz","year":"1983","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/0925-7721(94)90011-6_BIB26","first-page":"176","article-title":"Extremal polygon containment problems","author":"Toledo","year":"1991","journal-title":"Proc. 7th ACM Symp. on Computational Geometry"},{"key":"10.1016\/0925-7721(94)90011-6_BIB27","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1137\/0204030","article-title":"Parallelism in comparison problems","volume":"4","author":"Valiant","year":"1975","journal-title":"SIAM J. Comput."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772194900116?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772194900116?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:56:09Z","timestamp":1555138569000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772194900116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["0925772194900116"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(94)90011-6","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}