A (1+ε)-approximate Euclidean distance function that is differentiable and returns gradients, using O(n/ε^(d/2)) space and O(log(n/ε)) query time.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Differentiable Approximations for Distance Queries
A (1+ε)-approximate Euclidean distance function that is differentiable and returns gradients, using O(n/ε^(d/2)) space and O(log(n/ε)) query time.