Abstract
We prove a near-linear bound on the combinatorial complexity of the union of n fat convex objects in the plane, each pair of whose boundaries cross at most a constant number of times.
Original language | English (US) |
---|---|
Pages (from-to) | 171-189 |
Number of pages | 19 |
Journal | Discrete and Computational Geometry |
Volume | 23 |
Issue number | 2 |
DOIs | |
State | Published - Mar 2000 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics