Optimized the clockwise winding algorithm used in the creation of BSPs. By utilizing the newly created BSP structure itself for traversal it meant the global node and subsector arrays could be removed entirely.
Plus an additional optimization which uses a global hEdge sort buffer rather than allocate one every time it is needed.
Refactored the PerpDist and ParallelDist utility routines and moved them into m_misc.d Superblocks now use an integer array to represent their bounding box.
Added by danij almost 17 years ago
Added by danij almost 17 years ago
Optimized the clockwise winding algorithm used in the creation of BSPs. By utilizing the newly created BSP structure itself for traversal it meant the global node and subsector arrays could be removed entirely.
Plus an additional optimization which uses a global hEdge sort buffer rather than allocate one every time it is needed.
Refactored the PerpDist and ParallelDist utility routines and moved them into m_misc.d
Superblocks now use an integer array to represent their bounding box.