Approximate Nearest Line Search in High Dimensions

DOI10.1137/1.9781611973730.25zbMath1371.68295OpenAlexW4230028334MaRDI QIDQ5362980

Sepideh Mahabadi

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/efec55d4e071b1cec5188d79bd9bde71ae7c4b80

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (3)

Unnamed Item ⋮ Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points ⋮ Unnamed Item

This page was built for publication: Approximate Nearest Line Search in High Dimensions