Space-efficient dynamic orthogonal point location, segment intersection, and range reporting

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 894-903

  Blelloch, Guy E ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POINT LOCATION; UNIT COST;

DEPRECIATION; INTERSECTIONS;

DATA STRUCTURES;

EID: 58449103041     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. M. Ajtai, M. L. Fredman, and J. Komlos. Hash functions for priority queues. Information and Control, 63(3):217-225, Dec. 1986.
2. L. Arge, G. Brodal, and L. Georgiadis. Improved dynamic planar point location. In Proc. 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006.
3. L. Arge and J. S. Vitter. Optimal dynamic interval management in external memory. In Proc. 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 560-569, 1996.
4. B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput., 17:427-462, 1988.
5. B. Chazelle and L. Guibas. Fractional cascading. Algorithmica, 1:133-196, 1986.
6. E. D. Demaine, J. Iacono, and S. Langerman. Retroactive data structures. In Proc. 15th Annual ACM- SIAM Symposium on Discrete Algorithms (SODA), pages 274-283, 2004.
7. P. F. Dietz and Ft. Raman. Persistence, amortization and randomization. In Proc. 2nd Annual ACM-SIAM Symposium on Discrete algorithms (SODA), pages 78-88, 1991.
8. P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), pages 365-372, 1987.
9. M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48(3):533-551, June 1994.
10. K. Mehlhorn and S. Naher. Dynamic fractional cascading. Algorithmica, 5(2):215-241, 1990.
11. C. W. Mortensen. Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time. In Proc. 14th Annual ACM- SIAM Symposium on Discrete algorithms (SODA), pages 618-627, 2003.
12. C. W. Mortensen. Fully dynamic orthogonal range reporting on RAM. SIAM J. Comput., 35(6):1494-1525, 2006.
13. Y. Nekrich. Space efficient dynamic orthogonal range reporting. In Proc. 21st Annual Symposium on Computational geometry, pages 306-313, 2005.
14. M. H. Overmars. Design of Dynamic Data Structures. Springer-Verlag, New York, 1987.
15. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10:99-127, 1977.
16. D. E. Willard. A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Information and Computation, 97(2):150-204, 1992.