Space exploration via proximity search

DOI10.1007/s00454-016-9801-7zbMath1350.68265arXiv1412.1398OpenAlexW1811843193MaRDI QIDQ312150

Sariel Har-Peled, Benjamin Raichel, Nirman Kumar, David M. Mount

Publication date: 14 September 2016

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.1398

zbMATH Keywords

clusteringapproximation algorithmsnearest neighbors

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items

Active-learning a convex body in low dimensions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving capacitated clustering problems
• Learning smooth shapes by probing
• Clustering to minimize the maximum intercluster distance
• A characterization theorem and an algorithm for a convex hull problem
• Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
• Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem
• Introduction to the Mathematics of Subdivision Surfaces
• Shape from probing
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• Algorithms in real algebraic geometry