Whether a closed planar outline names enough distinct, finite corners,
reporting the first reason it does not.
The minimum corner count differs by what the outline may carry: a straight
face needs three, while an outline whose edges may bulge needs only two,
because a full circle is two half-turn arcs and demanding a third corner
would outlaw a round oculus for no geometric reason. Then every coordinate
must be finite, each non-finite one reported at <path>[i].<axis>, and no
two consecutive corners, the closing pair included, may lie within
BUILT_PLANAR_EPSILON (1e-9 m) of each other. A failed count or a non-finite
corner stops before the later test, which could not be computed.
Whether a closed planar outline names enough distinct, finite corners, reporting the first reason it does not.
The minimum corner count differs by what the outline may carry: a straight face needs three, while an outline whose edges may bulge needs only two, because a full circle is two half-turn arcs and demanding a third corner would outlaw a round oculus for no geometric reason. Then every coordinate must be finite, each non-finite one reported at
<path>[i].<axis>, and no two consecutive corners, the closing pair included, may lie withinBUILT_PLANAR_EPSILON(1e-9 m) of each other. A failed count or a non-finite corner stops before the later test, which could not be computed.