Approximating Nearest Neighbor Distances
From MaRDI portal
Publication:3449817
DOI10.1007/978-3-319-21840-3_17zbMath1444.68276arXiv1502.08048OpenAlexW2098790909WikidataQ59942733 ScholiaQ59942733MaRDI QIDQ3449817
Donald R. Sheehy, Brittany Terese Fasy, Ameya Velingker, Amir Nayyeri, Michael B. Cohen, Gary Lee Miller
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.08048
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Shortest path through random points
- Linear stability of planar solidification fronts
- Approximating Nearest Neighbor Distances
- Determining approximate shortest paths on weighted polyhedral surfaces
- The weighted region problem
- Efficient algorithms for globally optimal trajectories
- A fast algorithm for well-spaced points and approximate delaunay graphs
- Beating the spread
- Topological inference via meshing