Range closest-pair search in higher dimensions
From MaRDI portal
Publication:5896868
DOI10.1016/j.comgeo.2020.101669zbMath1474.68414arXiv1905.01029OpenAlexW3033289831MaRDI QIDQ5896868
Timothy M. Chan, Jie Xue, Saladi Rahul
Publication date: 7 January 2021
Published in: Lecture Notes in Computer Science, Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.01029
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Data structures for range-aggregate extent queries
- Optimal partition trees
- Range searching with efficient hierarchical cuttings
- Reporting points in halfspaces
- Efficient partition trees
- Cutting hyperplanes for divide-and-conquer
- Range-max queries on uncertain data
- On the power of the semi-separated pair decomposition
- Linear-space data structures for range mode query in arrays
- Closest-pair queries in fat rectangles
- Conditional lower bounds for space/time tradeoffs
- Two-Dimensional Range Diameter Queries
- Higher Lower Bounds from the 3SUM Conjecture
- Searching for the closest-pair in a query translate
- New Bounds for Range Closest-Pair Problems
- Colored range closest-pair problem under general distance functions
- Distance Oracles beyond the Thorup--Zwick Bound
This page was built for publication: Range closest-pair search in higher dimensions
