On levels in arrangements of lines, segments, planes, and triangles

Discrete and Computational Geometry

Volumn 19, Issue 3, 1998, Pages 315-331

  Agarwal, P K ^a   Aronov, B ^b   Chan, T M ^c   Sharir, M ^d,e  

^a Duke University   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

^c UNIVERSITY OF MIAMI   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

^e NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032372467     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009348     Document Type: Article

References (31)

1. P. K. Agarwal, B. Aronov, and M. Sharir, On levels in arrangements of lines, segments, planes, and triangles, Proc. 13th ACM Symp. on Computational Geometry, 1997, pp. 30-38.
2. A. Andrzejak and E. Welzl, k-Sets and j-Facets: A survey. Manuscript. In preparation.
3. B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, Points and triangles in the plane and halving planes in space. Discrete Comput. Geom., 6 (1991), 435-442.
4. I. Bárány, Z. Füredi, and L. Lovász, On the number of halving planes, Combinatorica, 10 (1990). 175-183.
5. K. Clarkson, A bound on local minima of arrangements that implies the Upper Bound Theorem, Discrete Comput. Geom., 10 (1993). 427-433.
6. K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput. Geom., 5 (1990), 99-160.
7. K. Clarkson and P. Shor, Applications of random sampling in computational geometry II, Discrete Comput. Geom., 4 (1989). 387-421.
8. T. Dey, Improved bounds for planer k-sets and related problems, Discrete Comput. Geom., this issue, pp. 373-382. Also in Proc. 38th IEEE Symp. on Foundations of Computer Science, 1997, pp. 156-161.
9. T. Dey, Improved bounds for planer k-sets and related problems, Discrete Comput. Geom., this issue, pp. 373-382. Also in Proc. 38th IEEE Symp. on Foundations of Computer Science, 1997, pp. 156-161.
10. T. Dey, personal communication.
11. T. Dey and H. Edelsbrunner, Counting triangle crossings and halving planes. Discrete Comput. Geom., 12 (1994), 281-289.
12. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.
13. H. Edelsbrunner, L. Guibas, and M. Sharir, The upper envelope of piecewise linear functions: Algorithms and applications. Discrete Comput. Geom., 4 (1989), 311-336.
14. D. Eppstein, Geometric lower bounds for parametric matroid optimization, Proc. 27th ACM Symp. on Theory of Computing, 1995, pp. 662-671.
15. P. Erdos, L. Lovász, A. Simmons, and E. G. Straus, Dissection graphs of planar point sets, In: A Survey of Combinatorial Theory (J. N. Srivastava et al., eds), North-Holland. Amsterdam, 1973, pp. 139-149.
16. J. E. Goodman and R. Pollack, Allowable sequences and order types in discrete and computational geometry, In: New Trends in Discrete and Computational Geometry, Algorithms and Combinatorics (J. Pach, Ed.), vol. 10, Springer-Verlag, New York, 1993, pp. 103-134.
17. D. Gusfield, Sensitivity Analysis for Combinatorial Optimization, Ph.D. thesis, University of California at Berkeley, 1980.
18. D. Gusfield, Bounds for the parametric minimum spanning tree problem, In: Proc. Humboldt Conference on Graph Theory, Combinatorics and Computing, 1979, Utilitas Mathematica, pp. 173-183.
19. D. Halperin and M. Sharir, On disjoint concave chains in arrangements of (pseudo) lines, Inform. Process. Lett., 40 (1991), 189-192.
20. D. Halperin and M. Sharir, Corrigendum: On disjoint concave chains in arrangements of (pseudo) lines, Inform. Process. Lett., 51 (1994), 53-56.
21. N. Katoh, T. Tokuyama, and K. Iwano, On minimum and maximum spanning trees of linearly moving points, Discrete Comput. Geom., 13 (1995), 161-176.
22. M. Klawe, M. Paterson, and N. Pippenger, unpublished manuscript.
23. L. Lovász, On the number of halving lines, Ann. Univ. Sci. Budapest, Eötvös, Sec. Math., 14 (1971), 107-108.
24. J. Matoušek, Reporting points in halfspaces, Comput. Geom. Theory Appl., 2 (1992), 169-186.
25. J. Pach and M. Sharir, The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis, Discrete Comput. Geom., 4 (1989), 291-309.
26. J. Pach, W. Steiger, and M. Szemerédi, An upper bound on the number of planar k-sets, Discrete Comput. Geom., 7 (1992), 109-123.
27. M. Sharir, On k-sets in arrangements of curves and surfaces. Discrete Comput. Geom., 6 (1991), 593-613.
28. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
29. H. Tamaki and T. Tokuyama, How to cut pseudo-parabolas into segments, In: Proc. 11th ACM Symp. on Computational Geometry, 1995, pp. 230-237.
30. H. Tamaki and T. Tokuyama, A characterization of planar graphs by pseudo-line arrangements, Manuscript, 1997.
31. R. Živaljević and S. Vrećica, The colored Tverberg's problem and complexes of injective functions, J. Combin. Theory Ser. A, 61 (1992), 309-318.