# zbMATH — the first resource for mathematics

On the complexity of the union of fat convex objects in the plane. (English) Zbl 0944.68183
Summary: 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.

##### MSC:
 68U05 Computer graphics; computational geometry (digital and algorithmic aspects)
##### Keywords:
combinatorial complexity
Full Text: