How to cut pseudoparabolas into segments

Discrete and Computational Geometry

Volumn 19, Issue 2, 1998, Pages 265-290

  Tamaki, Hisao ^a   Tokuyama, Takeshi ^a  

^a IBM RESEARCH TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032364015     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/pl00009345     Document Type: Article

References (19)

1. M. Atallah, Some Dynamic Computational Geometry Problems, Comput. Math. Appl. 11 (1985), 1171-1181.
2. B. Bollobas, Graph Theory, Springer-Verlag, New York, 1979.
3. K. Clarkson and P. Shor, Applications of Random Sampling in Computational Geometry II, Discrete Comput. Geom. 4 (1989), 387-421.
4. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1986.
5. H. Edelsbrunner and E. Welzl, On the Maximum Number of Edges in Many Faces in an Arrangement, J. Combin. Theory Ser. A 41 (1986), 159-166.
6. D. Eppstein, Geometric Lower Bounds for Parametric Matroid Optimization, Proc. 27th STOC, 1995, pp. 662-671.
7. L. Guibas and M. Sharir, Combinatorics and Algorithms of Arrangements, in New Trends in Discrete and Computational Geometry, J. Pach, ed., Springer-Verlag, New York, 1991, pp. 9-33.
8. D. Gusfield, Bounds for the Parametric Spanning Tree Problem, Proc. Humbolt Conf. on Graph Theory, Combinatorics and Computing, Utilitas Mathematica, Winnipeg, Man., 1979, pp. 173-183.
9. N. Katoh and T. Ibaraki, On the Total Number of Pivots Required for Certain Parametric Combinatorial Optimization Problems, Working Paper No. 71, Institute of Economic Research, Kobe University of Commerce, 1983.
10. N. Katoh, T. Tokuyama, and K. Iwano, On Minimum and Maximum Spanning Trees of Linearly Moving Points, Proc. 33rd FOCS, 1992, pp. 396-405.
11. K. Kedem and M. Sharir, An Efficient Motion Planning Algorithm for Convex Polygonal Objects Moving in 2-Dimensional Space, Discrete Comput. Geom. 5 (1990), 43-75.
12. J. van Lint and R. Wilson, A Course in Combinatorics, Cambridge University Press, Cambridge, 1992.
13. L. Lovász, On the Ratio of Optimal Integral and Fractional Covers, Discrete Math. 13 (1975), 383-390.
14. J. Matoušek, Lower bounds on the Length of Monotone Paths in Arrangements, Discrete Comput. Geom. 6 (1991), 129-134.
15. J. Matoušek, On Geometric Optimization with Few Violated Constraints, Proc. 10th ACM on Computational Geometry, 1994, pp. 312-321.
16. M. Sharir, On k-Sets in Arrangements of Curves and Surfaces, Discrete Comput. Geom. 6 (1991) 593-613.
17. P. Turán, On an Extremal Problem in Graph Theory, Mat. Fiz. Lapok. 48 (1941) 436-451.
18. D. J. A. Welsh, Matroid Theory, Academic Press, London, 1976.
19. E. Welzl, More on k-Sets of Finite Sets in the Plane, Discrete Comput. Geom. 1 (1986), 95-100.