Weak ε-nets and interval chains

Journal of the ACM

Volumn 55, Issue 6, 2008, Pages

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

^a TEL AVIV UNIVERSITY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Interval chain; Inverse Ackermann function; Moment curve; Weak epsilon net

Indexed keywords

CONTROL THEORY; MARINE BIOLOGY; PROBABILITY DENSITY FUNCTION;

ACKERMANN FUNCTIONS; INTERVAL CHAIN; INVERSE ACKERMANN FUNCTION; LINEAR SIZES; MINIMUM SIZES; MOMENT CURVE; NONEMPTY INTERVALS; PLANAR POINT SETS; POINT SETS; UPPER AND LOWER BOUNDS; WEAK EPSILON-NET;

FUNCTIONS;

EID: 57849095064     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1455248.1455252     Document Type: Article

References (20)

1. ALON, N., BÁRANY, I., FÜREDI, Z., AND KLEITMAN, D. J. 1992. Point selections and weak ε-nets for convex hulls. Combin. Probab. Comput. 1, 189-200.
2. ALON, N., AND SCHIEBER, B. 1987. Optimal preprocessing for answering on-line product queries. Tech. Rep. 71/87, The Moise and Frida Eskenasy Institute of Computer Science, Tel-Aviv University, Tel-Aviv, Israel.
3. ARONOV, B., AURENHAMMER, f., HURTADO, f., LANGERMAN, S., RAPPAPORT, D., SMORODINSKY, S., AND SEARA, C. 2005. Small weak epsilon nets. In Proceedings of the 17th Canadian Conference on Computational Geometry. 52-56.
4. BABAZADEH, M., AND ZARRABI-ZADEH, H. 2006. Small weak epsilon-nets in three dimensions. In Proceedings of the 18th Canadian Conference on Computational Geometry. 47-50.
5. BRADFORD, P. G., AND CAPOYLEAS, V. 1997. Weak ε-nets for points on a hypersphere. Disc. Comput. Geom. 18, 83-91.
6. CHANDRA, A. K., FORTUNE, S., AND LIPTON, R. 1985. Unbounded fan-in circuits and associative functions. J. Comput. Syst. Sci. 30, 222-234.
7. CHAZELLE, B., EDELSBRUNNER, H., EPPSTEIN, D., GRIGNI, M., GUIBAS, L., SHARIR, M., AND WELZL, E. 1995a. Algorithms for weak ε-nets. Unpublished manuscript. Available at http://citeseer.ist.psu.edu/24190.html.
8. CHAZELLE, B., EDELSBRUNNER, H., GRIGNI, M., GUIBAS, L., SHARIR, M., AND WELZL, E. 1995b. Improved bounds on weak ε-nets for convex sets. Disc. Comput. Geom. 13, 1-15.
9. CHAZELLE, B., AND ROSENBERG, B. 1991. The complexity of computing partial sums off-line. Int. J. Comput. Geom. Appl. 1, 33-45.
10. CONDON, A., AND SAKS, M. 2004. A limit theorem for sets of stochastic matrices. Linear Algebra Appl. 381, 61-76.
11. DOLEV, D., DWORK, C., PIPPENGER, N., AND WIGDERSON, A. 1983. Superconcentrators, generalizers and generalized connectors with limited depth. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing. ACM, New York, 42-51.
12. MATOUŠEK, j. 2002a. Lectures on Discrete Geometry. Springer-Verlag, New York.
13. MATOUŠEK, j. 2002b. A lower bound for weak ε-nets in high dimension. Disc. Comput. Geom. 28, 45-48.
14. MATOUŠEK, j., AND WAGNER, U. 2004. New constructions of weak ̌-nets. Disc. Comput. Geom. 32, 195-206.
15. MUSTAFA, N. H., AND RAY, S. 2007. Weak ε-nets have basis of size O(l/ε log(l/ε)) in any dimension. In Proceedings of the 23rd Annual ACM Symposium on Computational Geometry. ACM, New York, 239-244.
16. PUDLÁK, P. 1994. Communication in bounded depth circuits. Combinatorica 14, 203-216.
17. SEIDEL, R. 2006. Understanding the inverse ackermann function. PDF presentation. Available at http://cgi.di.uoa.gr/~ewcg06/invited/Seidel.pdf.
18. SHARIR, M., AND AGARWAL, P. K. 1995. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge, UK.
19. SUNDAR, R. 1992. On the deque conjecture for the splay algorithm. Combinatorica 12, 95-124.
20. YAO, A. C. 1982. Space-time tradeoff for answering range queries. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing. ACM, New York, 128-136.