{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T20:18:15Z","timestamp":1767212295942},"reference-count":14,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"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":[[1998,6]]},"DOI":"10.1016\/s0020-0190(98)00075-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"277-283","source":"Crossref","is-referenced-by-count":27,"title":["Algorithms for three-dimensional dominance searching in linear space"],"prefix":"10.1016","volume":"66","author":[{"given":"Christos","family":"Makris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanasios","family":"Tsakalidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00075-1_BIB1","series-title":"Proc. ACM Symposium on Computational Geometry","first-page":"150","article-title":"Biased finger trees and three-dimensional layers of maxima","author":"Atallah","year":"1994"},{"key":"10.1016\/S0020-0190(98)00075-1_BIB2","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1006\/jagm.1995.1010","article-title":"Two- and three-dimensional point location in rectangular subdivisions","volume":"18","author":"de Berg","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(98)00075-1_BIB3","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0215051","article-title":"Filtering search: a new approach to query answering","volume":"15","author":"Chazelle","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00075-1_BIB4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02187875","article-title":"Linear space data structures for two types of range search","volume":"3","author":"Chazelle","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0020-0190(98)00075-1_BIB5_1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01840440","article-title":"Fractional cascading: I","volume":"1","author":"Chazelle","year":"1986","journal-title":"Applications, Algorithmica"},{"key":"10.1016\/S0020-0190(98)00075-1_BIB5_2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01840441","article-title":"A data structuring technique, II","volume":"1","author":"Chazelle","year":"1986","journal-title":"Applications, Algorithmica"},{"key":"10.1016\/S0020-0190(98)00075-1_BIB6","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. Systems Sci."},{"key":"10.1016\/S0020-0190(98)00075-1_BIB7","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/0020-0190(82)90068-0","article-title":"On the equivalence of some rectangle problems","volume":"14","author":"Edelsbrunner","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00075-1_BIB8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0020-0190(87)90174-8","article-title":"A log log n data structure for three-sided range queries","volume":"25","author":"Fries","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00075-1_BIB9","series-title":"Proc. 16th Ann. ACM Symp. on Theory of Computing","first-page":"135","article-title":"Scaling and related techniques for geometry problems","author":"Gabow","year":"1984"},{"key":"10.1016\/S0020-0190(98)00075-1_BIB10","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(90)90022-P","article-title":"Bounded ordered dictionaries in O(log log N) time and O(n) space","volume":"35","author":"Mehlhorn","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00075-1_BIB11","series-title":"Computational Geometry, An Introduction","author":"Preparata","year":"1988"},{"key":"10.1016\/S0020-0190(98)00075-1_BIB12","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/6138.6151","article-title":"Planar point location using persistent search trees","volume":"29","author":"Sarnak","year":"1986","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0190(98)00075-1_BIB13","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."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000751?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000751?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:54:45Z","timestamp":1556643285000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0020019098000751"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00075-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}