Module surface_bisect 

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

Functions

surface_could_contain

BFS over subdivisions of surface, exploring every node up to the max_nodes budget (never stopping early at the first hit) and returning the union of every converged patch’s own (u, v) domain (each axis as a single unsharp interval scalar spanning that patch, not a numeric midpoint — see patch_uv) — a patch converges once its convex hull could contain point and its maximum span (max of the u-edge and v-edge of its control net) is no longer definitely greater than min_subdivision_size. None if no patch converged within budget.

surface_definitely_not_contains

Boolean negation of surface_could_contain.