Survey of Box-based Algorithms for Collision Detection
Ying Li
Abstract
Ying Li
Abstract
Different algorithms for collision detections(CD)in virtual scene were surveyed.The principle and effectiveness of axis-aligned bounding boxes(AABB)method,oriented bounding box method(OBB),discrete orientation polytopes(k-DOP)method and Space-Time Bounding Boxes(STBB)method were discussed in detail.The results of analysis prove that the simpleness of bounding box is in contradiction with the compactness of wrapped object and the k-DOP method is between AABB method and OBB method in the effectiveness of CD.The main results are useful for designing virtual scene.
OpenAlex reports 18 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Different algorithms for collision detections(CD)in virtual scene were surveyed.The principle and effectiveness of axis-aligned bounding boxes(AABB)method,oriented bounding box method(OBB),discrete orientation polytopes(k-DOP)method and Space-Time Bounding Boxes(STBB)method were discussed in detail.The results of analysis prove that the simpleness of bounding box is in contradiction with the compactness of wrapped object and the k-DOP method is between AABB method and OBB method in the effectiveness of CD.The main results are useful for designing virtual scene.
Key concepts: Minimum bounding box, Collision detection, Bounding volume, Bounding overwatch, Compact space, Algorithm, Computer science, Polytope