On dominance reporting in 3D

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5193 LNCS, Issue , 2008, Pages 41-51

  Afshani, Peyman ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY PROCESSING;

EXTERNAL MEMORY MODELS; LINEAR SPACES; MATCHING QUERY; MODELS OF COMPUTATION; OPTIMAL RESULTS; POINTER MACHINES; RANGE SEARCHING; SPACE COMPLEXITY;

RANDOM ACCESS STORAGE;

EID: 57749204742     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87744-8_4     Document Type: Conference Paper

References (19)

1. Edelsbrunner, H., Overmars, M.H.: On the equivalence of some rectangle problems. Information Processing Letters 14 (May 1982)
2. Agarwal, P.K.: Range searching. In: Goodman, J.E., O'Rourke, J. (eds.) CPC Handbook of Discrete and Computational Geometry (2004)
3. Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. AMS Press, Providence (1999)
4. Alstrup, S., Brodai, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: FOCS 2000: Proceedings of the 41st annual symposium on foundations of computer science, Washington, DC, USA, p. 198. IEEE Computer Society, Los Alamitos (2000)
5. Chazelle, B.: Functional approach to data structures and its use in multidimensional searching. SIAM J. Comput. 17(3), 427-462 (1988)
6. Nekrich, Y.: A data structure for multi-dimensional range reporting. In: SCG 2007: Proceedings of the 23rd annual symposium on computational geometry, pp. 344-353. ACM. New York (2007)
7. Subramanian, S., Ramaswamy, S.: The P-range tree: a new data structure for range searching in secondary memory. In: SODA '95: Proceedings of the 6th annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 378-387 (1995)
8. Vengroff. D.E., Vitter, J.S.: Efficient 3-D range searching in external memory. In: STOC 1996: Proceedings of the 28th annual ACM symposium on theory of computing, pp. 192-201. ACM, New York (1996)
9. Makris, C., Tsakalidis, A.: Algorithms for three-dimensional dominance searching in linear space. Inf. Process. Lett. 66(6), 277-283 (1998)
10. Chazelle, B., Edelsbrunner, H.: Linear space data structures for two types of range search. Discrete and Computational Geometry 2(1), 113. 126 (1987)
11. JaJa, J., Mortensen. C.W., Shi, Q.: Space-efficient and fast algorithms for multidimensional dominance reporting and counting. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 558-568. Springer, Heidelberg (2004)
12. Vitter, J.S.: External memory algorithms and data structures: dealing with massive data. ACM Comput. Surv. 33(2). 209-271 (2001) (updated. 2007), http://www.cs.duke.edu/~ jsv/Papers/catalog/
13. Nekrich. Y.: I/O-efficient point location in a set of rectangles. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 687-698. Springer, Heidelberg (2008)
14. Agarwal, P.K., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput. 29(3). 912-953 (2000)
15. Matoušek. J.: Reporting points in halfspaces. Computational Geometry: Theory and Applications 2(3), 169-186 (1992)
16. Agarwal, P.K., Arge, L., Erickson, J., Franciosa, P.G., Vitter, J.S.: Efficient searching with linear constraints. J. Comput. Syst. Sci. 61(2), 194-216 (2000)
17. Ramos, E.A.: On range reporting, ray shooting and k-level construction. In: SCG 1999:Proceedings of the 14th Annual Symposium on Computational Geometry, pp. 390-399 (1999)
18. de Berg, M., van Kreveld, M., Snoeyink, J.: Two- and three-dimensional point location in rectangular subdivisions. J. Algorithms 18(2), 256-277 (1995)
19. Aronov, B., Har-Peled, S., Sharir, M.: On approximate halfspace range counting and relative epsilon-approximations. In: SCG 2007: Proceedings of the 23rd annual symposium on Computational geometry, pp. 327-336. ACM, New York (2007)