The reasoning behind the result is as follows. Suppose a segment in a conforming triangulation has been split into two subsegments of lengths a and b, as illustrated in Figure 3.29. 29 offers an example where the bound is obtained. Cardinality Bounds for Triangulations with Bounded Minimum Angle . This algorithm first adds edges to Omega to subdivide it into easy to triangulate monotone faces.
Cardinality bounds for triangulations with bounded minimum angle .
In Sixth Canadian Conference on Computational Geometry, 1994. The reasoning behind the result is as follows. Suppose a segment in a conforming triangulation has been split into two subsegments of lengths a and b, as illustrated in Figure 15. Cardinality Bounds for Triangulations with Bounded Minimum Angle . Sixth Canadian Conference on Computational Geometry, 1994.