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.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received April 7, 1998, and in revised form August 24, 1999.
Rights and permissions
About this article
Cite this article
Efrat, A., Sharir, M. On the Complexity of the Union of Fat Convex Objects in the Plane . Discrete Comput Geom 23, 171–189 (2000). https://doi.org/10.1007/PL00009494
Issue Date:
DOI: https://doi.org/10.1007/PL00009494