LIPIcs.SOCG.2015.374.pdf
- Filesize: 0.69 MB
- 16 pages
Document
Space Exploration via Proximity Search
Authors
-
Part of:
Volume:
31st International Symposium on Computational Geometry (SoCG 2015)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Computational Geometry (SoCG) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2015-06-12
Cite AsGet BibTex
Sariel Har-Peled, Nirman Kumar, David M. Mount, and Benjamin Raichel. Space Exploration via Proximity Search. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 374-389, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LIPIcs.SOCG.2015.374
https://doi.org/10.4230/LIPIcs.SOCG.2015.374
Abstract
We investigate what computational tasks can be performed on a point set in R^d, if we are only given black-box access to it via nearest-neighbor search. This is a reasonable assumption if the underlying point set is either provided implicitly, or it is stored in a data structure that can answer such queries. In particular, we show the following:
(A) One can compute an approximate bi-criteria k-center clustering of the point set, and more generally compute a greedy permutation of the point set.
(B) One can decide if a query point is (approximately) inside the convex-hull of the point set.
We also investigate the problem of clustering the given point set, such that meaningful proximity queries can be carried out on the centers of the clusters, instead of the whole point set.
Keywords
- Proximity search
- implicit point set
- probing
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads