Separate an ordered mesh sequence along one positive local axis, retaining
every shape, normal and transverse coordinate. Each earlier/later pair passes
an axial bound or complete projected overlap. A signed minimum g imposes
t[later]-t[earlier] >= clearance-g. A forward longest-path pass satisfies all
pair constraints without an iterative collision correction or a guessed size.
Translations are nondecreasing before their common half-range is subtracted;
the first/last translations therefore balance around zero. Already separated
input has zero travel. Returned meshes own their buffers.
Mesh coordinates and nonnegative clearance use metres. Input order is the
requested order, not an inferred spatial sort. The same ray-parallel limit as
measureAutoMovieMeshClearance applies; this does not pack arbitrary volumes
around corners or preserve an external path after separation.
Separate an ordered mesh sequence along one positive local axis, retaining every shape, normal and transverse coordinate. Each earlier/later pair passes an axial bound or complete projected overlap. A signed minimum g imposes t[later]-t[earlier] >= clearance-g. A forward longest-path pass satisfies all pair constraints without an iterative collision correction or a guessed size. Translations are nondecreasing before their common half-range is subtracted; the first/last translations therefore balance around zero. Already separated input has zero travel. Returned meshes own their buffers.
Mesh coordinates and nonnegative clearance use metres. Input order is the requested order, not an inferred spatial sort. The same ray-parallel limit as measureAutoMovieMeshClearance applies; this does not pack arbitrary volumes around corners or preserve an external path after separation.