Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time

Authors:
Christian Worm Mortensen
Affiliations:
IT University of Copenhagen
Venue:
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2003

Citing 16
Cited 15

Data structures and algorithms 3: multi-dimensional searching and computational geometry

Data structures and algorithms 3: multi-dimensional searching and computational geometry
New data structures for orthogonal range queries

SIAM Journal on Computing
Adding range restriction capability to dynamic data structures

Journal of the ACM (JACM)
Computational geometry: an introduction

Computational geometry: an introduction
Two algorithms for maintaining order in a list

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Dynamic orthogonal segment intersection search

Journal of Algorithms
Efficient dynamic algorithms for some geometric intersection problems

Information Processing Letters
Persistence, amortization and randomization

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time

Information and Computation
Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Applications of range query theory to relational data base join and selection operations

Journal of Computer and System Sciences
Design of Dynamic Data Structures

Design of Dynamic Data Structures
Optimal Algorithms for List Indexing and Subset Rank

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
A Sparse Table Implementation of Priority Queues

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Dynamic Algorithms in Computational Geometry

Dynamic Algorithms in Computational Geometry
Optimal dynamic interval management in external memory

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Space efficient dynamic orthogonal range reporting

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
An optimal dynamic interval stabbing-max data structure?

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Conflict detection and resolution in two-dimensional prefix router tables

IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for spreading points

Journal of Algorithms
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Uniquely Represented Data Structures for Computational Geometry

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions

ACM Transactions on Algorithms (TALG)
Succinct indexes for strings, binary relations and multilabeled trees

ACM Transactions on Algorithms (TALG)
Approximation algorithms for spreading points

WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Rank-Sensitive data structures

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Fully retroactive approximate range and nearest neighbor searching

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Stabbing horizontal segments with vertical rays

Proceedings of the twenty-eighth annual symposium on Computational geometry
Full-Fledged real-time indexing for constant size alphabets

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
On d-regular schematization of embedded paths

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the two dimensional fully-dynamic orthogonal range reporting problem and the two dimensional fully-dynamic orthogonal line segment intersection reporting problem in the comparison model. We show that if n is the number of stored elements, then these problems can be solved in worst case time Θ(log n) plus time proportional to the size of the output pr. operation.