Small weak epsilon-nets in three dimensions

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006

Volumn , Issue , 2006, Pages 47-50

  Babazadeh, Maryam ^a   Zarrabi Zadeh, Hamid ^b  

^a UNIVERSITY OF TEHRAN   (Iran)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY;

CONSTANT SIZES; CONVEX SET; HALF SPACES; RANGE SPACES; THREE DIMENSIONS; UPPER AND LOWER BOUNDS;

COMPUTATIONAL GEOMETRY;

EID: 57849106639     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. N. Alon, I. Bárány, Z. Füredi, and D. Kleitman. Point selections and weak ε-nets for convex hulls. Combin. Probab. Comput., 1(3):103–112, 1992.
2. B. Aronov, F. Aurenhammer, F. Hurtado, S. Langerman, D. Rappaport, S. Smorodinsky, and C. Seara. Small weak epsilon nets. In Proc. 17th Canadian Conf. on Comput. Geom., pages 52–56, 2005.
3. B. Chazelle, H. Edelsbrunner, M. Grigni, L. J. Guibas, M. Sharir, and E. Welzl. Improved bounds on weak ε-nets for convexsets. Discrete Comput. Geom., 13:1–15, 1995.
4. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, 1987.
5. D. Haussler and E. Welzl. Epsilon nets and simplex range searching. Discrete Comput. Geom., 2:127–151, 1987.
6. J. Matoušek and U. Wagner. New constructions of weak epsilon-nets. In Proc. 19th ACM Sympos. Comput. Geom., pages 129–135, 2003.
7. F. Yao, D. Dobkin, H. Edelsbrunner, and M. Paterson. Partitioning space for range queries. SIAM J. Comput., 18(2):371–384, 1989.