Better bounds on the union complexity of locally fat objects
Mark de Berg · 2010
We prove that the union complexity of a set of n constant-complexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the maximum number of times the boundaries of any two objects intersect. This improves the previously best known bound by a logarithmic factor.