Weak ∈-nets and interval chains

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 1194-1203

  Alon, Noga ^a   Kaplan, Haim ^a   Nivasch, Gabriel ^a   Sharir, Micha ^a   Smorodinsky, Shakhar ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

LOWER BOUNDS; MINIMUM SIZE; MOMENT CURVE;

CONTROL THEORY; FUNCTIONS; PROBABILITY DENSITY FUNCTION;

MARINE BIOLOGY;

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

References (16)

1. 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., pp. 52-56, 2005.
2. N. Alon, I. Bárány, Z. Füredi, and D. J. Kleitman, Point selections and weak ∈-nets for convex hulls, Combin. Probab. Comput., 1:189-200, 1992.
3. N. Alon and B. Schieber, Optimal preprocessing for answering on-line product queries, Tech. Report 71/87, The Moise and Frida Eskenasy Institute of Computer Science, Tel Aviv University, 1987.
4. M. Babazadeh and H. Zarrabi-Zadeh, Small weak epsilon-nets in three dimensions, in Proc. 18th Canadian Conf. on Comput. Geom., pp. 47-50, 2006.
5. P. G. Bradford and V. Capoyleas, Weak ∈-nets for points on a hypersphere, Discrete Comput. Geom., 18:83-91, 1997.
6. B. Chazelle, H. Edelsbrunner, D. Eppstein, M. Grigni, L. Guibas, M. Sharir, and E. Welzl, Algorithms for weak ∈-nets, unpublished manuscript, 1995. Available at http://citeseer.ist.psu.edu/24190.html.
7. B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, M. Sharir, and E. Welzl, Improved bounds on weak ∈- nets for convex sets, Discrete Comput. Geom., 13:1-15, 1995.
8. B. Chazelle and B. Rosenberg, The complexity of computing partial sums off-line, Int. J. Comput. Geom. Appi, 1:33-45, 1991.
9. A. Condon and M. Saks, A limit theorem for sets of stochastic matrices, Linear Algebra Appl, 381:61-76, 2004.
10. J. Matoušek, A lower bound for weak ∈-nets in high dimension, Discrete Comput. Geom., 28:45-48, 2002.
11. J. Matoušek, Lectures on Discrete Geometry, Springer- Verlag, New York, 2002.
12. J. Matoušek and U. Wagner, New constructions of weak ∈-nets, Discrete Comput. Geom., 32:195-206, 2004.
13. N. H. Mustafa and S. Ray, Weak ∈-nets have basis of size O(l/∈log(l/∈)) in any dimension, in Proc. 23rd ACM Sympos. on Comput. Geom., pp. 239-244, 2007.
14. R. Seidel, Understanding the inverse Ackermann function, PDF presentation. Available at http://cgi.di. uoa.gr/~ewcg06/invited/Seidel.pdf.
15. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, Cambridge, 1995.
16. A. C. Yao, Space-time tradeoff for answering range queries, in Proc. 14th Annu. ACM Symp. on Theory of pp. 128-136, 1982.