{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T09:44:23Z","timestamp":1648979063134},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":["Computers & Graphics"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1016\/0097-8493(89)90081-2","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:49:30Z","timestamp":1060300170000},"page":"329-336","source":"Crossref","is-referenced-by-count":2,"title":["SEPARATION\u2122 in d dimensions or strip mining in asteroid fields"],"prefix":"10.1016","volume":"13","author":[{"given":"Michel P.","family":"Devine","sequence":"first","affiliation":[]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-8493(89)90081-2_BIB1","series-title":"ICALP'84","first-page":"119","article-title":"The complexity and decidability of SEPARATION\u2122","volume":"172","author":"Chazelle","year":"1984"},{"key":"10.1016\/0097-8493(89)90081-2_BIB2","series-title":"SIGACT Symposium on Theory of Computing","first-page":"154","article-title":"On translating a set of rectangles","author":"Guibas","year":"1980"},{"key":"10.1016\/0097-8493(89)90081-2_BIB3","article-title":"Separability of sets of polygons","author":"Dehne","year":"1986"},{"key":"10.1016\/0097-8493(89)90081-2_BIB4","article-title":"Algorithms for Computational Geometry","author":"Nurmi","year":"1987","journal-title":"Ph.D. thesis"},{"key":"10.1016\/0097-8493(89)90081-2_BIB5","series-title":"Computational Geometry","first-page":"335","article-title":"Movable separability of sets","author":"Toussaint","year":"1985"},{"key":"10.1016\/0097-8493(89)90081-2_BIB6","article-title":"Finding the x \u2212 y convex hull of a set of x \u2212 y polygons","author":"Montuno","year":"1982"},{"key":"10.1016\/0097-8493(89)90081-2_BIB7","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/BF01933620","article-title":"Constructing the X-Y convex hull of a set of X-Y polygons","volume":"23","author":"Nicholl","year":"1983","journal-title":"BIT"},{"key":"10.1016\/0097-8493(89)90081-2_BIB8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0255(84)90025-2","article-title":"On the definition and computation of rectilinear convex hulls","volume":"33","author":"Ottmann","year":"1984","journal-title":"Information Sciences"},{"key":"10.1016\/0097-8493(89)90081-2_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","article-title":"Quad trees: A data structure for retrieval on composite keys","volume":"4","author":"Finkel","year":"1974","journal-title":"Acta Informatica"},{"key":"10.1016\/0097-8493(89)90081-2_BIB10","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0196-6774(81)90027-4","article-title":"The measure problem for rectangular regions in d-space","volume":"2","author":"van Leeuwen","year":"1981","journal-title":"Journal of Algorithms"},{"key":"10.1016\/0097-8493(89)90081-2_BIB11","series-title":"Proceedings of the 29th Annual Symposium on Foundations of Computer Science","first-page":"550","article-title":"New upper bounds in Klee's measure problem (extended abstract)","author":"Overmars","year":"1988"},{"key":"10.1016\/0097-8493(89)90081-2_BIB12","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Comm. of the ACM"},{"key":"10.1016\/0097-8493(89)90081-2_BIB13","article-title":"Algorithms for Klee's rectangle problems","author":"Bentley","year":"1977"},{"key":"10.1016\/0097-8493(89)90081-2_BIB14","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0097-8493(89)90081-2_BIB15","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","article-title":"Priority search trees","volume":"14","author":"McCreight","year":"1985","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"10.1016\/0097-8493(89)90081-2_BIB16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0215021","article-title":"The ultimate planar convex hull algorithm","volume":"15","author":"Kirkpatrick","year":"1986","journal-title":"SIAM Journal on Computing"}],"container-title":["Computers & Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097849389900812?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097849389900812?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T06:30:27Z","timestamp":1552631427000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097849389900812"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0097849389900812"],"URL":"https:\/\/doi.org\/10.1016\/0097-8493(89)90081-2","relation":{},"ISSN":["0097-8493"],"issn-type":[{"value":"0097-8493","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}