A box hierarchy over resident entries, initially median-partitioned by
buildAutoMovieMeshQueryHierarchy and optionally given fresh entries/bounds by
refitAutoMovieMeshQueryHierarchy while preserving that partition. Signed and
separation queries, collectAutoMovieSpatialQueryCandidates and the human
nearest-centre envelope walk the same node representation.
Every node carries the componentwise XYZ extrema of every entry below it, in
the entries' shared metre frame, so a node's box distance is a lower bound
for every descendant and a walker may skip a node its query cannot reach.
A leaf holds the entries themselves, by reference and in partition order; a
branch holds two disjoint halves. Callers tell the variants apart with
"triangles" in node.
A box hierarchy over resident entries, initially median-partitioned by buildAutoMovieMeshQueryHierarchy and optionally given fresh entries/bounds by refitAutoMovieMeshQueryHierarchy while preserving that partition. Signed and separation queries, collectAutoMovieSpatialQueryCandidates and the human nearest-centre envelope walk the same node representation.
Every node carries the componentwise XYZ extrema of every entry below it, in the entries' shared metre frame, so a node's box distance is a lower bound for every descendant and a walker may skip a node its query cannot reach. A leaf holds the entries themselves, by reference and in partition order; a branch holds two disjoint halves. Callers tell the variants apart with
"triangles" in node.