Efficient Collision Detection
Construct QuOSPO Trees ( Pre-processing)
Create a LUT for the Map between the QOSs
Apply Standard Recursive Algorithm
Internal Node Overlap Checking
- If Node1 Has Not Been Processed
- Find the RTPO of Node 1 in the Second QOS through Map Lookup of PO
- Project OBB 1 onto RTPO
- Conservative: Three Range Checking on RTPO
- Reason for Saving Intervals on All the Orientations
- Dual Process: Swap Node1 and Node2