Module curve_bisect 

The previous curve/point containment — convex hull test and bisection — kept only as the baseline for examples/curve_contains_bench.rs. The kernel uses super::curve.

Functions

curve_could_contain

BFS over subdivisions of curve, exploring every node up to the max_nodes budget (never stopping early at the first hit) and returning the [Scalar::union] of every converged segment’s own domain — a segment converges once its convex hull could contain point and its chord length is no longer definitely greater than min_subdivision_size. None if no segment converged within budget.