Curve–curve intersection by per-axis fat line clipping — the design is
curve_curve.md next to this file; it reuses the clip of
contains/curve.md and the search schedule of contains/surface.md.
The previous curve–curve search — convex hull tests and bisection, with
coincidence read from reaching max_solutions — kept only as the
baseline for examples/intersection_bench.rs. The kernel uses
super::curve_curve.
Curve–surface intersection by per-axis fat line clipping — the design is
curve_surface.md next to this file; it is curve_curve with one more
parameter.
The previous curve–surface search — convex hull tests and bisection,
with coincidence read from reaching max_solutions — kept only as the
baseline for examples/intersection_bench.rs. The kernel uses
super::curve_surface.
Result of a subdivision-based intersection search: either the complete,
finite set of distinct solutions (fewer than the caller’s requested
max_solutions), or a signal that the two shapes coincide/overlap over a
shared region rather than meeting at finitely many isolated points.