On the equivalence of some rectangle problems
From MaRDI portal
Cites work
- A Lower Bound on the Complexity of Orthogonal Range Queries
- Finding extreme points in three dimensions and solving the post-office problem in the plane
- Multidimensional divide-and-conquer
- Priority Search Trees
- Rectilinear line segment intersection, layered segment trees, and dynamization
- Worst-case optimal insertion and deletion methods for decomposable searching problems
Cited in
(14)- Massively parallel entity matching with linear classification in low dimensional space
- Geometric containment and vector dominance
- A new algorithm for rectangle enclosure reporting
- The expected size of some graphs in computational geometry
- The space-optimal version of a known rectangle enclosure reporting algorithm
- Adaptive data structures for 2D dominance colored range counting
- A unified approach to geometric problems using dual cone transformation:
- Algorithms for three-dimensional dominance searching in linear space.
- A worst-case efficient algorithm for hidden-line elimination†
- Approximate covering detection among content-based subscriptions using space filling curves
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems
- On Dominance Reporting in 3D
- On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors
- Direct dominance of points
This page was built for publication: On the equivalence of some rectangle problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165008)
