{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:42:54Z","timestamp":1777596174635,"version":"3.51.4"},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2004,8]]},"abstract":"<jats:p> We present in this paper fast algorithms for the 3-D dominance reporting and counting problems, and generalize the results to the d-dimensional case. Our 3-D dominance reporting algorithm achieves O( log n\/ log log n+f) query time using O(n log <jats:sup>\u220a<\/jats:sup> n) space, where f is the number of points satisfying the query and \u220a&gt;0 is an arbitrarily small constant. For the 3-D dominance counting problem (which is equivalent to the 3-D range counting problem), our algorithm runs in O(( log n\/ log log n)<jats:sup>2<\/jats:sup>) time using O(n log<jats:sup>1+\u220a<\/jats:sup>n\/ log log n) space. <\/jats:p>","DOI":"10.1142\/s0129054104002686","type":"journal-article","created":{"date-parts":[[2004,8,30]],"date-time":"2004-08-30T07:36:17Z","timestamp":1093851377000},"page":"673-684","source":"Crossref","is-referenced-by-count":9,"title":["FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING"],"prefix":"10.1142","volume":"15","author":[{"given":"QINGMIN","family":"SHI","sequence":"first","affiliation":[{"name":"Institute of Advanced Computer Studies and Department  of Electrical and Computer Engineering, University of Maryland,  College Park, MD 20742, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JOSEPH","family":"JAJA","sequence":"additional","affiliation":[{"name":"Institute of Advanced Computer Studies and Department  of Electrical and Computer Engineering, University of Maryland,  College Park, MD 20742, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1137\/0215051"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1137\/0217026"},{"key":"rf5","first-page":"113","volume":"3","author":"Chazelle B.","journal-title":"Discrete Comput. Geom."},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840440"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90040-4"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80064-9"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1137\/0213024"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00075-1"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1137\/0214021"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1145\/358841.358852"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797322425"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054104002686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:39:52Z","timestamp":1565123992000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054104002686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8]]},"references-count":12,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2004,8]]}},"alternative-id":["10.1142\/S0129054104002686"],"URL":"https:\/\/doi.org\/10.1142\/s0129054104002686","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,8]]}}}