{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T17:54:23Z","timestamp":1649094863656},"reference-count":13,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/0020-0190(09)60016-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:22:55Z","timestamp":1027610575000},"page":"261-265","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for deciding the containment of polygons"],"prefix":"10.1016","volume":"59","author":[{"given":"Antonio Hern\u00e1ndez","family":"Barrera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(09)60016-8_BIB1","series-title":"Proc. 3rd ACM Symp. on Computational Geometry","first-page":"242","article-title":"Simultaneous containment of several polygons","author":"Avnaim","year":"1987"},{"key":"10.1016\/0020-0190(09)60016-8_BIB2","series-title":"Proc. STACS 88","first-page":"322","article-title":"Polygon placement under translation and rotation","volume":"294","author":"Avnaim","year":"1988"},{"key":"10.1016\/0020-0190(09)60016-8_BIB3","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1016\/0196-6774(86)90017-9","article-title":"Polygon containment under translation","volume":"7","author":"Baker","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(09)60016-8_BIB4","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","article-title":"Triangulating a simple polygon in linear time","volume":"6","author":"Chazelle","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(09)60016-8_BIB5","first-page":"1","volume":"1","author":"Chazelle","year":"1983","journal-title":"Adv. in Computer Research"},{"key":"10.1016\/0020-0190(09)60016-8_BIB6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(91)90023-R","article-title":"Efficient maintenance of the union of intervals on a line, with applications","volume":"12","author":"Cheng","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(09)60016-8_BIB7","first-page":"486","article-title":"Monotone polygon containment problems under translation","volume":"13","author":"Chiu","year":"1990","journal-title":"J. Inform. Processing"},{"key":"10.1016\/0020-0190(09)60016-8_BIB8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","article-title":"Topologically sweeping an arrangement","volume":"38","author":"Edelsbrunner","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(09)60016-8_BIB9","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/0215024","article-title":"Constructing arrangements of lines and hyperplanes with applications","volume":"15","author":"Edelsbrunner","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(09)60016-8_BIB10","series-title":"Proc. 12th ICALP","first-page":"189","article-title":"A fast algorithm for polygon containment by translation","volume":"194","author":"Fortune","year":"1985"},{"key":"10.1016\/0020-0190(09)60016-8_BIB11","series-title":"Proc. 19th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"8","article-title":"A dichromatic framework for balanced trees","author":"Guibas","year":"1978"},{"key":"10.1016\/0020-0190(09)60016-8_BIB12","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(81)90025-0","article-title":"Dynamization of order decomposable set problems","volume":"2","author":"Overmars","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(09)60016-8_BIB13","first-page":"160","article-title":"Computational Geometry, An Introduction","author":"Preparata","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019009600168?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019009600168?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T14:52:48Z","timestamp":1555944768000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019009600168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0020019009600168"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(09)60016-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}