Lower bounds for k-distance approximation

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2013, Pages 435-440

  Mérigot, Quentin ^a  

^a UNIV GRENOBLE ALPES   (France)

Author keywords

Chernoff bound; K distance; Order k Voronoi diagram

Indexed keywords

CHERNOFF BOUNDS; DISTINCT POINTS; EMPIRICAL MEASURE; HIGH PROBABILITY; LOWER BOUNDS; ORDER-K VORONOI DIAGRAMS; RANDOM POINTS; UNIT SPHERES;

COMPUTATIONAL GEOMETRY;

EID: 84879648993     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2462356.2462367     Document Type: Conference Paper

References (14)

1. Artstein-Avidan, S., Friedland, O., and Milman, V. Geometric applications of Chernoff-type estimates and a zigzag approximation for balls. Proceedings of the American Mathematical Society 134, 6 (2006), 1735-1742.
2. Bárány, I., and Steiger, W. On the expected number of k-sets. Discrete & Computational Geometry 11, 1 (1994), 243-263.
3. Bronshteyn, E., and Ivanov, L. The approximation of convex sets by polyhedra. Siberian Mathematical Journal 16, 5 (1975), 852-853.
4. Chazal, F., Cohen-Steiner, D., and Mérigot, Q. Geometric inference for probability measures. Foundations of Computational Mathematics 11 (2011), 733-751.
5. Edelsbrunner, H. Weighted alpha-shapes. Tech. Rep. UIUCDCS-R-92-1760, Department of Computer Science, University of Illinois, 1992.
6. Edelsbrunner, H., Valtr, P., and Welzl, E. Cutting dense point sets in half. Discrete & Computational Geometry 17, 3 (1997), 243-255.
7. Edelsbrunner, H., and Welzl, E. On the number of line separations of a finite set in the plane. Journal of Combinatorial Theory, Series A 38, 1 (1985), 15-29.
8. Erdos, P., Lovaśz, L., Simmons, A., and Straus, E. Dissection graphs of planar point sets, 1973.
9. Guibas, L., Mérigot, Q., and Morozov, D. Witnessed fc-distance. Discrete and Computational Geometry (2012). To appear.
10. Har-Peled, S., and Kumar, N. Down the rabbit hole: Robust proximity search and density estimation in sublinear space. In 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012 (2012), pp. 430-439.
11. Schneider, R. Convex bodies: the Brunn-Minkowski theory, vol. 44. Cambridge University Press, 1993.
12. Seidel, R. Personal communication.
13. Reported in H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, 1987.
14. Tóth, G. Point sets with many k-sets. Discrete & Computational Geometry 26, 2 (2001), 187-194.