Fast algorithms for 3-D dominance reporting and counting

International Journal of Foundations of Computer Science

Volumn 15, Issue 4, 2004, Pages 673-684

  Shi, Qingmin ^a   Jaja, Joseph ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Dominance Query; RAM Model; Range Counting; Range Reporting

Indexed keywords

EID: 29344462076     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054104002686     Document Type: Conference Paper

References (15)

1. S. Alstrup, G. S. Brodal, and T. Rauhe. New data structures for orthogonal range searching. In Proceedings of IEEE Symposium on Foundations of Computer Science, pages 198-207, Redondo Beach, CA, 2000.
2. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509-517, Sept. 1975.
3. B. Chazelle. Filtering search: A new approach to query-answering. SIAM Journal on Computing, 15(3):703-724, Aug. 1986.
4. B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing, 17(3):427-463, June 1988.
5. B. Chazelle and H. Edelsbrunner. Linear space data structures for two types of range search. Discrete Comput. Geom., 3:113-126, 1987.
6. B. Chazelle and L. J. Guibas. Fractional Cascading: I. A data structure technique. Algorithmica, 1(2): 133-162, 1986.
7. M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 47:424-436, 1993.
8. M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48:533-551, 1994.
9. H. N. Gabow, J. L. Bentley, and R. E. Tarjan. Scaling and related techniques for geometry problems. In Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pages 135-143, Washington, DC, 1984.
10. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338-355, 1984.
11. C. Makris and A. K. Tsakalidis. Algorithms for three-dimensional dominance searching in linear space. Information Processing Letters, 66(6):277-283, 1998.
12. E. M. McCreight. Priority search trees. SIAM Journal on Computing, 14(2):257-276, May 1985.
13. S. Subramanian and S. Ramaswamy. The P-range tree: A new data structure for range searching in secondary memory. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 378-387, 1995.
14. J. Vuillemin. A unifying look at data structures. Communications of the ACM, 23(4):229-239, 1980.
15. D. E. Willard. Examining computational geometry, van Emde Boas trees, and hashing from the perspective of the fusion three. SIAM Journal on Computing, 29(3):1030-1049, 2000.