Login / Signup
On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity in Computational Geometry.
R. Ryan Williams
Published in:
CoRR (2017)
Keyphrases
</>
computational geometry
convex hull
complexity theory
digital image analysis
digital geometry
computer graphics
nearest neighbor searching
art gallery
pairwise
discrete geometry
nearest neighbor
voronoi diagram
uniform sampling
computer vision
linear space
parametric curves