On levels in arrangements of curves, III: Further improvements

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2008, Pages 85-93

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Arrangements; Combinatorial geometry; K levels; K sets

Indexed keywords

ARRANGEMENTS; ASYMPTOTIC BOUNDS; COMBINATORIAL COMPLEXITIES; COMBINATORIAL GEOMETRY; CONSTANT VALUES; CURVE SEGMENTS; INTERSECTING CURVES; K-LEVELS; K-SETS; UPPER BOUNDS;

COMPUTATIONAL GEOMETRY;

EID: 57349107040     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1377676.1377691     Document Type: Conference Paper

References (21)

1. P. K. Agarwal, B. Aronov, T. M. Chan, and M. Sharir. On levels in arrangements of lines, segments, planes, and triangles. Discrete Comput. Geom., 19:315-331, 1998.
2. P. K. Agarwal, B. Aronov, and M. Sharir. On levels in arrangements of lines, segments, planes, and triangles. In Proc. 13th ACM Sympos. Comput. Geom., pages 30-38, 1997.
3. P. K. Agarwal, E. Nevo, J. Pach, R. Pinchasi, M. Sharir, and S. Smorodinsky. Lenses in arrangements of pseudo-circles and their applications. J. ACM, 51:139-186, 2004.
4. B. Aronov and M. Sharir. Cutting circles into pseudo-segments and improved bounds for incidences and complexity of many faces. Discrete Comput. Geom., 28:475-490, 2002.
5. T. M. Chan. On levels in arrangements of curves. Discrete Comput. Geom., 29:375-393, 2003.
6. T. M. Chan. On levels in arrangements of curves, II: a simple inequality and its consequences. Discrete Comput. Geom., 34:11-24, 2005.
7. T. M. Chan. On levels in arrangements of surfaces in three dimensions. In Proc. 16th ACM-SIAM Sympos. Discrete Algorithms, pages 232-240, 2005. Full version submitted to Discrete Comput. Geom.
8. T. M. Chan. On the bichromatic k-set problem. In Proc. 19th ACM-SIAM Sympos. Discrete Algorithms, pages 561-570, 2008.
9. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
10. T. K. Dey. Improved bounds on planar k-sets and related problems. Discrete Comput. Geom., 19:373-382, 1998.
11. H. Edelsbrunner and E. Welzl. On the number of line separations of a finite set in the plane. J. Combin. Theory Ser. A, 38:15-29, 1985.
12. P. Erdós, L. Lovász, A. Simmons, and E. Straus. Dissection graphs of planar point sets. In A Survey of Combinatorial Theory (J. N. Srivastava, ed.), North-Holland, Amsterdam, Netherlands, pages 139-154, 1973.
13. D. Gusfield. Bounds for the parametric minimum spanning tree problem. In Proc. Humboldt Conf. on Graph Theory. Combinatorics, and Computing, Utilitas Mathematica, pages 173-183, 1979.
14. L. Lovasz. On the number of halving lines. Ann. Univ. Set. Budapest, Eotvos, Sec. Math., 14:107-108, 1971.
15. A. Marcus and G. Tardos. Intersection reverse sequences and geometric applications. J. Combin. Theory Ser. A, 113:675-691, 2006.
16. J. Pach, W. Steiger, and E. Szemerédi. An upper bound on the number of planar k-sets. Discrete Comput. Geom., 7:109-123, 1992.
17. R. Pinchasi and R. Radoičić. Topological graphs with no self-intersecting cycle of length 4. In Proc. 19th ACM Sympos. Comput. Geom., pages 98-103, 2003.
18. M. Sharir, S. Smorodinsky, and G. Tardos. An improved bound for k-sets in three dimensions. Discrete Comput. Geom., 26:195-204, 2001.
19. H. Tamaki and T. Tokuyama. A characterization of planar graphs by pseudo-line arrangements. In Proc. 8th Int. Sympos. Algorithms and Computation, Lect. Notes Comput. Sci., vol. 1350, Springer-Verlag, pages 123-132, 1997.
20. H. Tamaki and T. Tokuyama. How to cut pseudoparabolas into segments. Discrete Comput. Geom., 19:265-290, 1998.
21. G. Tóth. Point sets with many k-sets. Discrete Comput. Geom., 26:187-194, 2001.