Small weak epsilon nets

Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG 2005

Volumn , Issue , 2005, Pages 52-56

  Aronov, Boris ^a   Aurenhammer, Franz ^b   Hurtado, Ferran ^c   Langerman, Stefan ^d   Rappaport, David ^e   Smorodinsky, Shakhar ^f   Seara, Carlos ^c  

^a POLYTECHNIC UNIVERSITY   (United States)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^d UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^e QUEEN S UNIVERSITY   (Canada)

^f NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (6)

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):189-200, 1992.
2. B. Chazelle. The Discrepancy Method. Cambridge University Press, 2000.
3. L. Danzer. Zur Lösung des Gallaischen Problems über Kreisscheiben in der euklidischen Ebene. Studia Sci. Math. Hungar., 21:111-134, 1986.
4. H. Hadwiger, H. Debrunner and V. Klee. Combinatorial Geometry in the Plane. Holt, Reinhart and Winston, New York, 1964.
5. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete Comput. Geom., 2:127-151, 1987.
6. J. Matoušek. Lectures in Discrete Geometry Springer-Verlag, 2002.