Finite dimensionless threshold in (0,1), admitted by the caller; any feasible nonparallel tight pair with smaller absolute determinant causes query refusal.
Ordered finite unit [nx,nz] directions for nx X + nz Z <= h; copied on preparation. The caller ensures bounded directions and limits their count.
Fixed half-plane directions prepared for independent changing-offset queries. Copy the admitted finite unit normals and compute every exact nonparallel pair once. A successful polygon supplies only a cyclic active-edge seed. Its next intersections must satisfy every current inequality before that seed can be reused; otherwise full pair enumeration replaces it. Bounded active normals and feasible cyclic corners prove the seed polygon equals the intersection. Every tight nonparallel pair still receives the weak-direction check. A conservative fixed-normal range certificate admits lazy coordinates only when every pair is finite; uncertified offsets retain full preflight. Offsets and output vertices are never cached or shared between queries. Callers bound the plane population and supply bounded section charts.
These are admitted inputs, not a runtime validator: preparation copies directions but does not check their unit length or boundedness. realizeAutoMovieConvexSupportLoft owns those checks on the loft path; direct and recovery callers must establish equivalent premises.