Witnessed k-distance

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2011, Pages 57-64

  Guibas, Leonidas ^a   Mérigot, Quentin ^b   Morozov, Dmitriy ^c  

^a Stanford University   (United States)

^b UNIV GRENOBLE ALPES   (France)

^c STANFORD UNIVERSITY   (United States)

Author keywords

Computational topology; Geometric inference; Power distance

Indexed keywords

APPROXIMATION SCHEME; COMBINATORIAL EXPLOSION; COMPACT SETS; COMPUTATIONAL TOPOLOGY; DISTANCE FUNCTIONS; GEOMETRIC INFERENCE; HAUSDORFF; POWER DISTANCE; PROBABILITY MEASURES;

EXPLOSIVES;

COMPUTATIONAL GEOMETRY;

EID: 79960187602     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1998196.1998205     Document Type: Conference Paper

References (18)

1. N. Amenta and M. Bern. Surface reconstruction by Voronoi filltering. Discrete and Computational Geometry, 22(4):481-504, 1999.
2. S. Arya and D. Mount. Computational geometry: proximity and location. Handbook of Data Structures and Applications, pages 63.1-63.22, 2005.
3. F. Bolley, A. Guillin, and C. Villani. Quantitative Concentration Inequalities for Empirical Measures on Non-compact Spaces. Probability Theory and Related Fields, 137(3):541-593, 2007.
4. F. Chazal, D. Cohen-Steiner, and A. Lieutier. A sampling theory for compact sets in Euclidean space. Discrete and Computational Geometry, 41(3):461-479, 2009.
5. F. Chazal, D. Cohen-Steiner, and Q. Mérigot. Geometric inference for probability measures. Preprint (INRIA RR-6930 v2), 2010.
6. F. Chazal and S. Oudot. Towards persistence-based reconstruction in Euclidean spaces. Proceedings of the ACM Symposium on Computational Geometry, pages 232-241, 2008.
7. K. Clarkson. Nearest-neighbor searching and metric space dimensions. Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, pages 15-59, 2006.
8. D. Cohen-Steiner, H. Edelsbrunner, and J. Harer. Stability of persistence diagrams. Discrete and Computational Geometry, 37(1):103-120, 2007.
9. D. Cohen-Steiner, H. Edelsbrunner, and D. Morozov. Vines and vineyards by updating persistence in linear time. In Proceedings of the ACM Symposium on Computational Geometry, pages 119-126, 2006. (Pubitemid 44300779)
10. S. Dasgupta. Learning mixtures of Gaussians. In Proceedings of the IEEE Symposium on Foundations of Computer Science, page 634, 1999.
11. T. Dey and S. Goswami. Provable surface reconstruction from noisy samples. Computational Geometry, 35(1-2):124-141, 2006.
12. H. Edelsbrunner. The union of balls and its dual shape. Discrete and Computational Geometry, 13:415-440, 1995.
13. H. Edelsbrunner and J. Harer. Persistent homology - a survey. Surveys on Discrete and Computational Geometry. Twenty Years Later, pages 257-282, 2008.
14. P. Indyk. Nearest neighbors in high-dimensional spaces. Handbook of Discrete and Computational Geometry, pages 877-892, 2004.
15. B. Kloeckner. Approximation by finitely supported measures. Preprint (arXiv:1003.1035), 2010.
16. P. Niyogi, S. Smale, and S. Weinberger. A topological view of unsupervised learning from noisy data. Preprint, 2008.
17. P. Niyogi, S. Smale, and S. Weinberger. Finding the homology of submanifolds with high confidence from random samples. Discrete and Computational Geometry, 39(1):419-441, 2008.
18. C. Villani. Topics in Optimal Transportation. American Mathematical Society, 2003.