Dynamic rectangular intersection with priorities

DOI10.1145/780542.780635MaRDI QIDQ3581261zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, Eyal Molad, Robert E. Tarjan

Publication date 16 August 2010

Published in Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/780542.780635

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Priority Search Trees
• Computing rectangle enclosures
• Dynamic orthogonal segment intersection search
• Dynamic Planar Range Maxima Queries
• Efficient dynamic algorithms for some geometric intersection problems

Cited in

(12)

• An in-place min-max priority search tree
• I/O efficient dynamic data structures for longest prefix queries
• Finding pairwise intersections of rectangles in a query rectangle
• Two-dimensional packet classification and filter conflict resolution in the internet
• Computing rectangle enclosures
• Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals
• scientific article; zbMATH DE number 4149177 (Why is no real title available?)
• Priority Search Trees
• Hierarchical representations of collections of small rectangles
• Dynamic algorithms for monotonic interval scheduling problem
• Finding pairwise intersections of rectangles in a query rectangle
• Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals

This page was built for publication: Dynamic rectangular intersection with priorities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581261)