On Locality-Sensitive Orderings and Their Applications
From MaRDI portal
Publication:3304732
DOI10.1137/19M1246493zbMath1451.68350arXiv1809.11147OpenAlexW3035278115MaRDI QIDQ3304732
Mitchell Jones, Timothy M. Chan, Sariel Har-Peled
Publication date: 3 August 2020
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.11147
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Approximation algorithms (68W25)
Related Items (4)
Minimum weight Euclidean \((1+\varepsilon)\)-spanners ⋮ Minimum weight Euclidean \((1+\varepsilon)\)-spanners ⋮ A spanner for the day after ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic data structures for approximate Hausdorff distance in the word RAM
- Well-separated pair decomposition in linear time?
- Approximate closest-point queries in high dimensions
- Preserving order in a forest in less than logarithmic time and linear space
- Approximate nearest neighbor queries revisited
- Surpassing the information theoretic bound with fusion trees
- Space-filling curves
- Dynamic Euclidean minimum spanning trees and extrema of binary functions
- Fault-tolerant geometric spanners
- Covering a ball with smaller equal balls in \(\mathbb R^n\)
- New Doubling Spanners: Better and Simpler
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Faster Fully-Dynamic Minimum Spanning Forest
- An Optimal Dynamic Spanner for Doubling Metric Spaces
- Approximation schemes for covering and packing problems in image processing and VLSI
- From hierarchical partitions to hierarchical covers
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- A tight bound on approximating arbitrary metrics by tree metrics
- Fully dynamic geometric spanners
This page was built for publication: On Locality-Sensitive Orderings and Their Applications
