Collision Detection Based on the Parallel Computing Hash Structure

In order to quickly complete the collision detection of moving objects in virtual space, a collision detection technique of parallel computing hash structure is proposed. The spatial decomposition method is used to decompose the virtual scene again, and delete the information of the basic geometric elements in the hash table in the previous moment. Using the corresponding hash function to find the index of the hash table, quickly find the corresponding geometric elements and delete the index, using the hash function to find the index under the new position, and then insert the basic geometric elements into the head of the new index, only a few elements in a time segment, to reduce the number of collision detection elements, shorten the collision detection time. Comparative experiments show that the proposed algorithm reduces the collision detection time and improves the detection efficiency.