Module search 

The default effort of the subdivision searches and the Newton refinement after them. These bound how hard a search tries, never what an answer means (see AGENTS.md): an operation that needs another value says so where it uses it, with its reason.

Constants

MAX_NODES

Node budget for a subdivision search (contains, intersection).

MIN_SUBDIVISION_SIZE

Where a subdivision search hands over to Newton (see AGENTS.md’s “Subdivide to isolate, then Newton to refine”).

NEAREST_HANDOFF

Where a nearest-point search hands over to Newton, as a fraction of the size of what it searches (NurbCurve::closest_point, NurbSurface::closest_point). Bounds effort only: every piece left at the handoff that could hold a nearer point is refined, so a coarser handoff only leaves Newton more pieces to start from.

PROJECT_ITERATIONS

Newton steps projecting a point onto a surface.

Functions

min_subdivision_size

MIN_SUBDIVISION_SIZE as a scalar.