On Locality-Sensitive Orderings and Their Applications
From MaRDI portal
Publication:5090394
DOI10.4230/LIPIcs.ITCS.2019.21OpenAlexW2964304985MaRDI QIDQ5090394
Timothy M. Chan, Mitchell Jones, Sariel Har-Peled
Publication date: 18 July 2022
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/10114/pdf/LIPIcs-ITCS-2019-21.pdf/
Related Items (1)
Cites Work
- 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
- 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
- An effective way to represent quadtrees
- 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
