The authors show that for every fixed δ > 0 the following holds: If F is a union of n triangles, all of whose angles are at least δ, then the complement of F has $O(n)$ connected components and the boundary of F consists of O(nlog log n) straight segments (where the constants of proportionality depend on δ). This latter complexity becomes linear if all triangles are of roughly the same size or if they are all infinite wedges.
No takes yet. Share an insight, caveat, or question.
Jiri et al. (1994) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: