{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T06:36:52Z","timestamp":1757572612458},"reference-count":15,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":[[1988,1]]},"DOI":"10.1016\/0020-0190(88)90188-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"307-312","source":"Crossref","is-referenced-by-count":7,"title":["Normalized divide-and-conquer: A scaling technique for solving multi-dimensional problems"],"prefix":"10.1016","volume":"26","author":[{"given":"Rolf G.","family":"Karlsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark H.","family":"Overmars","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(88)90188-3_BIB1","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/358841.358850","article-title":"Multidimensional divide and conquer","volume":"23","author":"Bentley","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(88)90188-3_BIB2","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/0196-6774(85)90030-6","article-title":"Batched dynamic solutions to decomposable searching problems","volume":"6","author":"Edelsbrunner","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(88)90188-3_BIB3","first-page":"135","article-title":"Scaling and related techniques for geometry problems","author":"Gabow","year":"1984","journal-title":"Proc. 16th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(88)90188-3_BIB4","series-title":"Ph.D. Thesis","article-title":"Conquering Contours, Efficient Algorithms for Computational Geometry","author":"G\u00fcting","year":"1983"},{"key":"10.1016\/0020-0190(88)90188-3_BIB5","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1109\/TC.1984.5009341","article-title":"Finding rectangle intersections by divide-and-conquer","volume":"C-33","author":"G\u00fcting","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(88)90188-3_BIB6","series-title":"Ph.D. Thesis","article-title":"Algorithms in a Restricted Universe","author":"Karlsson","year":"1984"},{"key":"10.1016\/0020-0190(88)90188-3_BIB7","series-title":"Proc. 2nd Symp. on Theoretical Aspects of Computer Science","first-page":"187","article-title":"Proximity on a grid","volume":"Vol. 182","author":"Karlsson","year":"1985"},{"key":"10.1016\/0020-0190(88)90188-3_BIB8","series-title":"Tech. Rept. RUU-CS-86-18","article-title":"Scanline Algorithms on a Grid","author":"Karlsson","year":"1986"},{"key":"10.1016\/0020-0190(88)90188-3_BIB9","first-page":"41","article-title":"Computational geometry on integer grids","author":"Keil","year":"1981","journal-title":"Proc. 19th Ann. Allerton Conf."},{"key":"10.1016\/0020-0190(88)90188-3_BIB10","first-page":"281","article-title":"Rastered point location","author":"Muller","year":"1985"},{"key":"10.1016\/0020-0190(88)90188-3_BIB11","series-title":"Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG 85)","first-page":"295","article-title":"Range searching on a grid","author":"Overmars","year":"1985"},{"key":"10.1016\/0020-0190(88)90188-3_BIB12","series-title":"Tech. Rept. RUU-CS-87-2","article-title":"Efficient Data Structures for Range Searching on a Grid","author":"Overmars","year":"1987"},{"key":"10.1016\/0020-0190(88)90188-3_BIB13","series-title":"Tech. Rept. RUU-CS-87-4","article-title":"Computational Geometry on a Grid: An Overview","author":"Overmars","year":"1987"},{"key":"10.1016\/0020-0190(88)90188-3_BIB14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","article-title":"Log-logarithmic worst-case range queries are possible in space \u0398(n)","volume":"17","author":"Willard","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(88)90188-3_BIB15","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0022-0000(84)90020-5","article-title":"New trie data structures which support very fast search operations","volume":"28","author":"Willard","year":"1984","journal-title":"J. Comput. System Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901883?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901883?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:20:20Z","timestamp":1555089620000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019088901883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,1]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1988,1]]}},"alternative-id":["0020019088901883"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(88)90188-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1988,1]]}}}