Construct G1 bitangent conics using Ahn's control-triangle subdivision scheme.
Basis: Y. J. Ahn, Conic approximation of planar curves, CAD 33 (2001),
867-872, doi:10.1016/S0010-4485(00)00110-X. The public primary abstract and
section preview establish endpoint tangent interpolation, positive fullness
factor and subdivision into a containing tangent triangle. The inaccessible
characterization theorem and its specific error function are NOT reproduced.
This explicitly labelled adaptation minimizes a sampled radial-correspondence
maximum distance instead: each source point and conic point lie on the same
ray from the tangent intersection. Its signed displacement increases with the
weight, so bisection balances positive and negative extreme discrepancies.
Samples at odd 1/32 intervals validate weights fitted on even intervals.
Their distance is an observable discrepancy, never a continuous Hausdorff
bound. A complete result only covers the supplied chart within this sampled
criterion. Inflections and inadmissible triangles cause bisection; exhausted
budgets omit unresolved intervals and return partial. Finite straight charts
admit an explicit collinear quadratic, the conic's degenerate case: exactly
collinear to roundoff, or, where the control triangle refuses a chart whose
curvature keeps its sign, when its samples advance along its chord within
toleranceMm of it (a bend below its coordinates' roundoff, between close
inflections, refused at every depth otherwise). Such a primitive's end
tangents are its chord's, so G1 holds there only to that tolerance's bend.
Source callbacks are borrowed and must
be deterministic; callback failures or nonfinite data refuse the whole call.
Incident endpoint jets request exact right/left limits so supplied breaks
preserve genuine source corners without finite-difference displacements.
Construct G1 bitangent conics using Ahn's control-triangle subdivision scheme.
Basis: Y. J. Ahn, Conic approximation of planar curves, CAD 33 (2001), 867-872, doi:10.1016/S0010-4485(00)00110-X. The public primary abstract and section preview establish endpoint tangent interpolation, positive fullness factor and subdivision into a containing tangent triangle. The inaccessible characterization theorem and its specific error function are NOT reproduced. This explicitly labelled adaptation minimizes a sampled radial-correspondence maximum distance instead: each source point and conic point lie on the same ray from the tangent intersection. Its signed displacement increases with the weight, so bisection balances positive and negative extreme discrepancies.
Samples at odd 1/32 intervals validate weights fitted on even intervals. Their distance is an observable discrepancy, never a continuous Hausdorff bound. A complete result only covers the supplied chart within this sampled criterion. Inflections and inadmissible triangles cause bisection; exhausted budgets omit unresolved intervals and return partial. Finite straight charts admit an explicit collinear quadratic, the conic's degenerate case: exactly collinear to roundoff, or, where the control triangle refuses a chart whose curvature keeps its sign, when its samples advance along its chord within toleranceMm of it (a bend below its coordinates' roundoff, between close inflections, refused at every depth otherwise). Such a primitive's end tangents are its chord's, so G1 holds there only to that tolerance's bend. Source callbacks are borrowed and must be deterministic; callback failures or nonfinite data refuse the whole call. Incident endpoint jets request exact right/left limits so supplied breaks preserve genuine source corners without finite-difference displacements.