Better \(\varepsilon\)-dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and \(\varepsilon\)-kernels. (English) Zbl 1395.68278
Proceedings of the 30th annual symposium on computational geometry, SoCG ’14, Kyoto, Japan, June 8–11, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2594-3). 416-425 (2014).
MSC:
| 68U05 | Computer graphics; computational geometry (digital and algorithmic aspects) |
| 68W20 | Randomized algorithms |
| 68W25 | Approximation algorithms |
| 68W40 | Analysis of algorithms |
