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.
Cite
CITATION STYLE
APA
Efrat, A., & Sharir, M. (1997). On the complexity of the union of fat objects in the plane. In Proceedings of the Annual Symposium on Computational Geometry (pp. 104–112). ACM. https://doi.org/10.1145/262839.262911
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free