On the complexity of the union of fat convex objects in the plane

Citation
A. Efrat et M. Sharir, On the complexity of the union of fat convex objects in the plane, DISC COM G, 23(2), 2000, pp. 171-189
Citations number
24
Categorie Soggetti
Engineering Mathematics
Journal title
DISCRETE & COMPUTATIONAL GEOMETRY
ISSN journal
01795376 → ACNP
Volume
23
Issue
2
Year of publication
2000
Pages
171 - 189
Database
ISI
SICI code
0179-5376(200003)23:2<171:OTCOTU>2.0.ZU;2-V
Abstract
We prove a near-linear bound on the combinatorial complexity of the union o f n fat convex objects in the plane, each pair of whose boundaries cross at most a constant number of times.