Dynamic rectangular intersection with priorities

Authors:
Haim Kaplan;Eyal Molad;Robert E. Tarjan
Affiliations:
Tel Aviv University, Tel Aviv, Israel;Tel Aviv University, Tel Aviv, Israel;Princeton University, Princeton NJ and Hewlett-Packard, Palo Alto, CA
Venue:
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Year:
2003

Citing 7
Cited 14

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

Data structures and algorithms 3: multi-dimensional searching and computational geometry
Self-adjusting binary search trees

Journal of the ACM (JACM)
Adding range restriction capability to dynamic data structures

Journal of the ACM (JACM)
A data structure for dynamic trees

Journal of Computer and System Sciences
Space Decomposition Techniques for Fast Layer-4 Switching

PfHSN '99 Proceedings of the IFIP TC6 WG6.1 & WG6.4 / IEEE ComSoc TC on on Gigabit Networking Sixth International Workshop on Protocols for High Speed Networks VI
O(log n ) Dynamic Packet Routing

ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Algorithms for packet classification

IEEE Network: The Magazine of Global Internetworking

An optimal dynamic interval stabbing-max data structure?

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient IP table lookup via adaptive stratified trees with selective reconstructions

Journal of Experimental Algorithmics (JEA)
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Compressing rectilinear pictures and minimizing access control lists

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
I/O Efficient Dynamic Data Structures for Longest Prefix Queries

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)
Dynamic trees in practice

Journal of Experimental Algorithmics (JEA)
Dynamic trees in practice

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
A traffic-aware top-N firewall ruleset approximation algorithm

Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
New results on two-dimensional orthogonal range aggregation in external memory

Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rank-Sensitive data structures

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
A dynamic stabbing-max data structure with sub-logarithmic query time

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
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present efficient data structures to maintain dynamic set of rectangles, each with priority assigned to it, such that we can efficiently find the rectangle of maximum priority containing a query point. Our data structures support insertions and deletions of rectangles. In one dimension, when rectangles are intervals, our most efficient data structure supports queries and insertions in O(log n) time, deletions in O(log n loglog n) time and requires linear space. When intervals are guaranteed to be nonoverlapping (but one can be nested within the other) we obtain a simpler data structure that supports all operations in O(log n) time.