On levels in arrangements of surfaces in three dimensions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 232-240

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; GEOMETRY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

COMBINATORIAL GEOMETRY; GEOMETRIC PROBLEMS; NONLINEAR CURVES; THREE DIMENSIONS;

SURFACES;

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

References (23)

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, 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.
3. B. Aronov, B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir, and R. Wenger. Points and triangles in the plane and halving planes in space. Discrete Comput. Geom., 6:435-442, 1991.
4. I. Bárány, Z. Füredi, and L. Lovász. On the number of halving planes. Combinatorica, 10:175-183, 1990.
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. In Proc. 44th IEEE Sympos. Found. Comput. Sci., pages 544-550, 2003.
7. T. K. Dey. Improved bounds on planar k-sets and related problems. Discrete Comput. Geom., 19:373-382, 1998.
8. T. K. Dey and H. Edelsbrunner. Counting triangle crossings and halving planes. Discrete Comput. Geom., 12:281-289, 1994.
9. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
10. D. Eppstein. Improved bounds for intersecting triangles and halving planes. J. Combin. Theory Ser. A, 62:176-182, 1993.
11. 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.
12. N. Katoh and T. Tokuyarna. Lovász's lemma for the three-dimensional k-level of concave surfaces and its applications. Discrete Comput. Geom., 27:567-584, 2002.
13. L. Lovász. On the number of halving lines. Ann. Univ. Sci. Budapest, Eötvös, Sec. Math., 14:107-108, 1971.
14. A. Marcus and G. Tardos. Intersection reverse sequences and geometric applications. To appear in Proc. 12th Int. Sympos. Graph Drawing, 2004.
15. J. Matoušek. Lectures on Discrete Geometry. Springer-Verlag, 2002.
16. J. Matoušek, M. Sharir, S. Smorodinsky, and U. Wagner. On k-sets in four dimensions. Manuscript, 2004.
17. J. Pach and P. K. Agarwal. Combinatorial Geometry. Wiley-Interscience, New York, 1995.
18. M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995.
19. M. Sharir, S. Smorodinsky, and G. Tardos. An improved bound for k-sets in three dimensions. Discrete Comput. Geom., 26:195-204, 2001.
20. 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.
21. H. Tamaki and T. Tokuyama. How to cut pseudoparabolas into segments. Discrete Comput. Geom., 19:265-290, 1998.
22. G. Tóth. Point sets with many k-sets. Discrete Comput. Geom., 26:187-194, 2001.
23. R. Živaljević and S. Vrećica. The colored Tverberg's problem and complexes of injective functions. J. Combin. Theory Ser. A, 61:309-318, 1992.