Refit an admitted hierarchy's fixed partition with fresh replacement entries.
The internal query owner supplies one replacement for every original leaf
entry, retaining its population and identity. Replacement bounds must enclose
the actual current geometry in one common metre frame. No entry is removed,
reordered or inspected for area; even a currently degenerate triangle keeps
its place for later snapshots. Boxes are recomputed from every replacement.
The returned tree and leaf arrays are independent of the source tree. Entry
ownership belongs to replace; the crossing owner returns fresh triangle
records, so snapshots share only their immutable index layout. This primitive
neither mutates a resident tree nor caches a previous world placement.
Refit an admitted hierarchy's fixed partition with fresh replacement entries. The internal query owner supplies one replacement for every original leaf entry, retaining its population and identity. Replacement bounds must enclose the actual current geometry in one common metre frame. No entry is removed, reordered or inspected for area; even a currently degenerate triangle keeps its place for later snapshots. Boxes are recomputed from every replacement.
The returned tree and leaf arrays are independent of the source tree. Entry ownership belongs to replace; the crossing owner returns fresh triangle records, so snapshots share only their immutable index layout. This primitive neither mutates a resident tree nor caches a previous world placement.