### Abstract

Let C^{+} and C^{-} be two collections of topological discs. The collection of discs is 'topological' in the sense that their boundaries are Jordan curves and each pair of Jordan curves intersect at most twice. We prove that the region ∪C^{+} - ∪C^{-} has combinatorial complexity at most 10n - 30 where p = |C^{+}|, q = |C^{-}| and n = p + q ≥ 5. Moreover, this bound is achievable. We also show less precise bounds that are stated as functions of p and q.

Original language | English (US) |
---|---|

Pages (from-to) | 207-223 |

Number of pages | 17 |

Journal | Computational Geometry: Theory and Applications |

Volume | 5 |

Issue number | 4 |

DOIs | |

State | Published - Nov 1995 |

### ASJC Scopus subject areas

- Computer Science Applications
- Geometry and Topology
- Control and Optimization
- Computational Theory and Mathematics
- Computational Mathematics

## Fingerprint Dive into the research topics of 'Combinatorial complexity of signed discs'. Together they form a unique fingerprint.

## Cite this

Souvaine, D. L., & Yap, C. K. (1995). Combinatorial complexity of signed discs.

*Computational Geometry: Theory and Applications*,*5*(4), 207-223. https://doi.org/10.1016/0925-7721(94)00026-X