Optimize|Bsp Builder: Reduced working memory requirement
Each recursion of the partitioning algorithm allocates a duplicate of the previous iteration's SuperBlockmap, which, was previously retained until all further subdivisions had completed.
The blockmap for each subdivision is now cleared once the half-edges have been either partitioned or collected to build a new BSP leaf (the underlying kd-tree is reduced to a single root node).
Added by danij about 12 years ago
Added by
Optimize|Bsp Builder: Reduced working memory requirement
Each recursion of the partitioning algorithm allocates a duplicate
of the previous iteration's SuperBlockmap, which, was previously
retained until all further subdivisions had completed.
The blockmap for each subdivision is now cleared once the half-edges
have been either partitioned or collected to build a new BSP leaf
(the underlying kd-tree is reduced to a single root node).