A Note on the Point-Clothoid Distance Algorithm

DOI10.48550/arXiv.2609.10179MaRDI QIDQ7288222arXivFDO

Authors Gong Cheng, Haibin Ye, Hao Ge

Publication date 9 September 2026

Published in arXiv

Tldr We study the candidate selection strategy of Frego and Bertolazzi's point-clothoid distance algorithm and prove its completeness for any query point and proper no-inflection planar clothoid segment with tangent-angle variation at most $2π$, showing that at most three stationary points exist, in min-max-min order.

Full work available at URL https://doi.org/10.48550/arXiv.2609.10179

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17) Numerical computation of solutions to single equations (65H05) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Graphical methods in numerical analysis (65S05)

arXiv classification

cs.CGmath.NA

Cites work

• Clothoid Spline Transition Spirals
• Point-Clothoid Distance and Projection Computation

This page was built for publication: A Note on the Point-Clothoid Distance Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288222)