{'fraction_non_alphanumeric': 0.009467455621301775, 'fraction_numerical': 0.0, 'mean_word_length': 5.609375, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An Optimized Collision Detection Algorithm Based on Dynamic Bounding Volume Tree

An optimized collision detection algorithm based on dynamic bounding volume tree is proposed in this paper. First this algorithm adopts spatial division to exclude objects which cant intersect to define the potential intersection areas. Then use a new dynamic OBB bounding volume tree to test whether the intersection happened between the objects in the same grid. At last, this algorithm improves the traditional overlapping test between the primitives for accurate collision detection to accelerate the detection between objects. Compared to the traditional collision detection algorithm based on OBB bounding volume. This algorithm can effectively improve the real-time of the collision detection without affecting the accuracy of original collision detection.