{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:34:11Z","timestamp":1759667651976},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"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":[[2003,5]]},"DOI":"10.1016\/s0925-7721(02)00128-1","type":"journal-article","created":{"date-parts":[[2003,2,28]],"date-time":"2003-02-28T14:00:13Z","timestamp":1046440813000},"page":"21-34","source":"Crossref","is-referenced-by-count":4,"title":["Translating a regular grid over a point set"],"prefix":"10.1016","volume":"25","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason","family":"Morrison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(02)00128-1_BIB001","series-title":"Proceedings of the 10th International Symposium on Algorithms and Computation, ISAAC","first-page":"403","article-title":"Output-sensitive algorithms for uniform partitions of points","volume":"1741","author":"Agarwal","year":"1999"},{"issue":"6","key":"10.1016\/S0925-7721(02)00128-1_BIB002","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1007\/BF01190156","article-title":"Algorithms for projecting points to give the most uniform distribution with applications to hashing","volume":"9","author":"Asano","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(02)00128-1_BIB003","unstructured":"J.L. Bentley, Solutions to Klee's rectangle problems, Technical Report, Carnegie-Mellon University, 1977"},{"key":"10.1016\/S0925-7721(02)00128-1_BIB004","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","article-title":"Algorithms for reporting and counting geometric intersections","volume":"28","author":"Bentley","year":"1979","journal-title":"IEEE Trans. on Comput. C"},{"issue":"2","key":"10.1016\/S0925-7721(02)00128-1_BIB005","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1137\/0211017","article-title":"Geometric problems with applications to hasing","volume":"11","author":"Comer","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(02)00128-1_BIB006","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0925-7721(02)00128-1_BIB007","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"1997"},{"issue":"1","key":"10.1016\/S0925-7721(02)00128-1_BIB008","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","article-title":"Making data structures persistent","volume":"38","author":"Driscoll","year":"1989","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/S0925-7721(02)00128-1_BIB009","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","article-title":"Finding the upper envelope of n line segments in O(nlogn) time","volume":"33","author":"Hershberger","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(02)00128-1_BIB010","series-title":"Advances in Computing Research","first-page":"91","article-title":"Maximum clique problem of rectangle graphs","author":"Lee","year":"1983"},{"key":"10.1016\/S0925-7721(02)00128-1_BIB011","series-title":"Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science","first-page":"493","article-title":"Concatenable segment trees (extended abstract)","volume":"349","author":"van Kreveld","year":"1989"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772102001281?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772102001281?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T11:52:49Z","timestamp":1553687569000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772102001281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0925772102001281"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(02)00128-1","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}