High-dimensional approximate r-nets - Inria - Institut national de recherche en sciences et technologies du numérique
Communication Dans Un Congrès Année : 2017

High-dimensional approximate r-nets

Résumé

The construction of r-nets offers a powerful tool in computational and metric geometry. We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computes approximate $r$-nets with respect to Euclidean distance. For any fixed \epsilon>0, the approximation factor is 1+\epsilon and the complexity is polynomial in the dimension and subquadratic in the number of points. The algorithm succeeds with high probability. More specifically, the best previously known LSH-based construction of Eppstein et al. [EHS15] is improved in terms of complexity by reducing the dependence on \epsilon, provided that $\epsilon$ is sufficiently small. Our method does not require LSH but, instead, follows Valiant's [Val15] approach in designing a sequence of reductions of our problem to other problems in different spaces, under Euclidean distance or inner product, for which r-nets are computed efficiently and the error can be controlled. Our result immediately implies efficient solutions to a number of geometric problems in high dimension, such as finding the (1+\epsilon)-approximate k-th nearest neighbor distance in time subquadratic in the size of the input.
Fichier principal
Vignette du fichier
EmirisEtalSoda1607.04755.pdf (243.92 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01636792 , version 1 (17-10-2018)

Identifiants

Citer

Georgia Avarikioti, Ioannis Z. Emiris, Loukas Kavouras, Ioannis Psarros. High-dimensional approximate r-nets. SODA: ACM/SIAM Symposium on Discrete Algorithms, Jan 2017, Barcelone, Spain. ⟨hal-01636792⟩
127 Consultations
107 Téléchargements

Altmetric

Partager

More