Better bounds for the union complexity of locally fat objects

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

7 Citations (Scopus)


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 languageEnglish
Title of host publicationProceedings 26th Annual ACM Symposium on Computational Geometry (SoCG'10, Snowbird UT, USA, June 13-16, 2010)
Place of PublicationNew York NY
PublisherAssociation for Computing Machinery, Inc
ISBN (Print)978-1-4503-0016-2
Publication statusPublished - 2010


Dive into the research topics of 'Better bounds for the union complexity of locally fat objects'. Together they form a unique fingerprint.

Cite this