K-levels of concave surfaces

Discrete and Computational Geometry

Volumn 27, Issue 4, 2002, Pages 567-584

  Katoh, Naoki ^a   Tokuyama, Takeshi ^b  

^a KYOTO UNIVERSITY   (Japan)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035999224     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-001-0086-z     Document Type: Article

References (17)

1. P. Agarwal, B. Aronov, T. Chan, and M. Sharir, On Levels in Arrangement of Lines, Segments, Planes, and Triangles, Discrete Comput. Geom. 19 (1998), 315-331.
2. B. Aronov and T. Dey, Polytopes in Arrangements, Proc. 15th ACM Symp. on Computational Geometry (1999), pp. 154-162.
3. I. Bárány, Z. Füredi, and L. Lovász, On the Number of Halving Planes, Combinatorica 10 (1990), 175-183.
4. T. Chan, On levels in Arrangement of Curves, Proc. 41st IEEE Symp. on Foundation of Computer Science (2000), pp. 219-227.
5. K. Clarkson, A Bound on Local Minima of Arrangement That Implies the Upper Bound Theorem, Discrete Comput. Geom. 10 (1993), 427-433.
6. T. Dey, Improved Bound on Planar k-Sets and Related Problems, Discrete Comput. Geom. 19 (1998), 373-383.
7. T. Dey and H. Edelsbrunner, Counting Triangle Crossings and Halving Planes, Discrete Comput. Geom. 12 (1994), 281-289.
8. H. Edelsbrunner, Algorithms in Combinatorial Geometry, ETACS Monographs of TCS, vol. 10, Springer-Verlag, New York, 1987.
9. D. Eppstein, Geometric Lower Bounds for Parametric Matroid Optimization, Proc. 27th STOC (1995), pp. 662-671.
10. D. Gusfleld, Bound for the Parametric Spanning Tree Problem, Proc. Humbolt Conf. on Graph Theory, Combinatorics, and Computing (1979), 173-183.
11. N. Katoh, K. Iwano, and T. Tokuyama, On Minimum and Maximum Spanning Trees of Linearly Moving Points, Discrete Comput. Geom. 13 (1995), 161-176.
12. N. Katoh, H. Tamaki, and T. Tokuyama, Parametric Polymatroid Optimization and Its Geometric Applications, Proc. 10th ACM-SIAM SODA (1999), pp. 517-526.
13. L. Lovász. On the Number of Halving Lines. Ann. Univ. Sci. Budapest Etövös Sect. Math. 14 (1971), 107-108.
14. M. Sharir, S. Smorodinsky, and G. Tardos, An Improved Bound for k-Sets in Three Dimensions, Proc. 16th ACM Symp. on Computational Geometry (2000), pp. 43-48.
15. H. Tamaki and T. Tokuyama, A Characterization of Planar Graphs by Pseudo-Line Arrangements, Proc. ISAAC 97, LNCS 1350, Springer-Verlag, Berlin, 1997, pp. 133-142.
16. H. Tamaki and T. Tokuyama, How to Cut Pseudo-Parabolas into Segments, Discrete Comput. Geom. 19 (1998), 265-290.
17. T. Tokuyama, Combinatorics on Arrangements and Parametric Matroids, a Bridge between Computational Geometry and Combinatrial Optimization, IEICE Trans. Inform. Syst. E83-D (2000), 362-371.