Parametric curve interrogation

A parametric curve interface supplies its parameter domain, evaluation, and derivatives where they exist. Robust geometric algorithms also need restricted subcurves and certified range or derivative bounds on parameter intervals. Tangent, speed and curvature are derived from point and derivative enquiries when the relevant derivatives are regular. Finite point samples alone cannot certify the absence of every plane intersection of an arbitrary smooth curve.

Intersecting a parametric curve with a plane reduces to isolating zeros of a scalar function. A certified range for $F$ rejects intervals that do not contain zero. On an interval whose derivative range excludes zero, a sign-changing endpoint bracket gives exactly one root, which bisection method or a safeguarded Newton root-finding iteration refines. Other intervals are subdivided conservatively; tangencies and coplanar pieces need multiplicity or identity tests supported by the representation. An unresolved small interval is a possible contact, not a proof of an intersection. With finitely many transverse intersections and convergent enclosures, isolation terminates to any prescribed tolerance.