Walk the loop from the seed by pseudo-arclength continuation, once to
measure its polygonal length and once in equal chords, then make the
reference-guide law used for requested normalized arclength.
Each step predicts P + h T along the curve's unit tangent
T = n_A x n_B (turned with the previous) and corrects on the plane
square to T through the prediction; the first walk halves a step that
fails or lands more than a quarter step off, and ends where the start
lies ahead within a step; the second takes walkPoints * count equal
steps of that length. The first step's length is the arc a part ring
step covers there, |A_phi| 2 pi / count.
The internal caller supplies captured count/tolerance values and the
unchanged public controls (64 first-walk steps per target, 4 guide
points per target and 6 closing trials). Valid finite counts, host-face
indices and regular callback jets remain premises, not new admissions.
Walk the loop from the seed by pseudo-arclength continuation, once to measure its polygonal length and once in equal chords, then make the reference-guide law used for requested normalized arclength.
Each step predicts
P + h Talong the curve's unit tangentT = n_A x n_B(turned with the previous) and corrects on the plane square toTthrough the prediction; the first walk halves a step that fails or lands more than a quarter step off, and ends where the start lies ahead within a step; the second takeswalkPoints * countequal steps of that length. The first step's length is the arc a part ring step covers there,|A_phi| 2 pi / count.The internal caller supplies captured count/tolerance values and the unchanged public controls (64 first-walk steps per target, 4 guide points per target and 6 closing trials). Valid finite counts, host-face indices and regular callback jets remain premises, not new admissions.