Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings 26th Annual ACM Symposium on Computational Geometry (SoCG'10, Snowbird UT, USA, June 13-16, 2010) |
Place of Publication | New York NY |
Publisher | Association for Computing Machinery, Inc |
Pages | 39-47 |
ISBN (Print) | 978-1-4503-0016-2 |
Publication status | Published - 2010 |