I/O-Efficient point location in a set of rectangles

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

Volumn 4957 LNCS, Issue , 2008, Pages 687-698

  Nekrich, Yakov ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; GEOMETRY; LOCATION; QUERY PROCESSING; THREE DIMENSIONAL;

BLOCK SIZES; EXTERNAL MEMORY; POINT LOCATION; SPACE DATA STRUCTURES; TWO-DIMENSIONAL RECTANGULAR; BLOCK SIZE; EXTERNAL MEMORY DATA; RECTANGLES; RECTANGULAR SUBDIVISION;

QUERY PROCESSING; SET THEORY;

EID: 43049134115     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78773-0_59     Document Type: Conference Paper

References (24)

1. Agarwal, P.K., Arge, L., Brodal, G.S., Vitter, J.S.: I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. In: Proc. SODA, pp. 11-20 (1999)
2. Agarwal, P.K., Arge, L., Yi, K.: An Optimal Dynamic Interval Stabbing-Max Data Structure? In: Proc. SODA, pp. 803-812 (2005)
3. Aggarwal, A., Vitter, J.S.: The Input/Output Complexity of Sorting and Related Problems. Communications of the ACM 31(9), 1116-1127 (1988)
4. Arge, L.: External Memory Data Structures. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 1-29. Springer, Heidelberg (2001)
5. Arge, L., Procopiuc, O., Ramaswamy, S., Suel, T., Vitter, J.S.: Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract). In: Proc. SODA, pp. 685-694 (1998)
6. Arge, L., Vengroff, D.E., Vitter, J.S.: External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. Algorithmica 47(1), 1-25 (2007)
7. Arge, L., Vahrenhold, J.: I/O-Efficient Dynamic Planar Point Location. Computational Geometry 29(2), 147-162 (2004)
8. Bender, M.A., Cole, R., Raman, R.: Exponential Structures for Efficient Cache-Oblivious Algorithms. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 195-207. Springer, Heidelberg (2002)
9. de Berg, M., van Kreveld, M.J., Snoeyink, J.: Two- and Three-Dimensional Point Location in Rectangular Subdivisions. J. Algorithms 18(2), 256-277 (1995)
10. Chazelle, B., Guibas, L.J.: Fractional Cascading: I. A Data Structuring Technique. Algorithmica 1, 133-162 (1986)
11. Crauser, A., Ferragina, P., Mehlhorn, K., Meyer, U., Ramos, E.A.: Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. Int. J. Comput. Geometry Appl. 11(3), 305-337 (2001)
12. Edelsbrunner, H., Haring, G., Hilbert, D.: Rectangular point location in d dimensions with applications. Computer J 29, 76-82 (1986)
13. van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and Implementation of an Efficient Priority Queue. Mathematical Systems Theory 10, 99-127 (1977)
14. Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-Oblivious Algorithms. In: Proc. FOCS 1999, pp. 285-298 (1999)
15. Gabow, H., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. STOC 1984, pp. 135-143 (1984)
16. Goodrich, M.T., Tsay, J.-J., Vengroff, D.E., Vitter, J.S.: External-Memory Computational Geometry (Preliminary Version). In: Proc. FOCS 1993, pp. 714-723 (1993)
17. Nekrich, Y.: A Data Structure for Multi-Dimensional Range Reporting. In: Proc. SoCG 2007, pp. 344-353 (2007)
18. Nekrich, Y.: External Memory Range Reporting on a Grid. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, Springer, Heidelberg (2007)
19. Pǎtraşcu, M., Thorup, M.: Time-space Trade-offs for Predecessor Search. In: Proc. STOC 2006, pp. 232-240 (2006)
20. Smid, M.: Dynamic rectangular point location, with an application to the closest pair problem. Information and Computation 116, 1-9 (1995)
21. Snoeyink, J.: Point Location. In: Handbook of Discrete and Computational Geometry, CRC Press, Inc., Boca Raton (1997)
22. Subramanian, S., Ramaswamy, S.: The P-range Tree: A New Data Structure for Range Searching in Secondary Memory. In: Proc. SODA 1995, pp. 378-387 (1995)
23. Vengroff, D.E., Vitter, J.S.: Efficient 3-D Range Searching in External Memory. In: Proc. STOC 1996, pp. 192-201 (1996)
24. Vitter, J.S.: External Memory Algorithms and Data Structures: Dealing with Massive Data. ACM Computing Surveys 33(2), 209-271 (2001)