## Abstract

Let Γ be a collection of unbounded x-monotone Jordan arcs intersecting at most twice each other, which we call pseudoparabolas, since two axis parallel parabolas intersect at most twice. We investigate how to cut pseudoparabolas into the minimum number of curve segments so that each pair of segments intersect at most once. We give an Ω (n^{4/3}) lower bound and O (n^{5/3}) upper bound on the number of cuts. We give the same bounds for an arrangement of circles. Applying the upper bound, we give an O (n^{23/12}) bound on the complexity of a level in an arrangement of pseudoparabolas, and an O (n^{11/6}) bound on the complexity of a combinatorially concave chain of pseudoparabolas. We also give some upper bounds on the number of transitions of the minimum weight matroid base when the weight of each element changes as a quadratic function of a single parameter.

Original language | English |
---|---|

Pages (from-to) | 265-290 |

Number of pages | 26 |

Journal | Discrete and Computational Geometry |

Volume | 19 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1998 Mar |

## ASJC Scopus subject areas

- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics