TY - GEN

T1 - Improved bound for the union of fat triangles

AU - Ezra, Esther

AU - Aronov, Boris

AU - Sharir, Micha

N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.

PY - 2011

Y1 - 2011

N2 - We show that, for any fixed δ > 0, the combinatorial complexity of the union of a triangles in the plane, each of whose angles is at least δ, is O(n2α(n) log* n). with the constant of proportionality depending oil δ. This considerably improves the twenty-year-old bound O(n log log n), due to Matoušek et al. [24, 25].

AB - We show that, for any fixed δ > 0, the combinatorial complexity of the union of a triangles in the plane, each of whose angles is at least δ, is O(n2α(n) log* n). with the constant of proportionality depending oil δ. This considerably improves the twenty-year-old bound O(n log log n), due to Matoušek et al. [24, 25].

UR - http://www.scopus.com/inward/record.url?scp=79955744683&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79955744683&partnerID=8YFLogxK

U2 - 10.1137/1.9781611973082.136

DO - 10.1137/1.9781611973082.136

M3 - Conference contribution

AN - SCOPUS:79955744683

SN - 9780898719932

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 1778

EP - 1785

BT - Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011

PB - Association for Computing Machinery

ER -