Hierarchical bounding box tree construction method on the basis of linked list sorting balanced binary tree

Abstract

The invention discloses a hierarchical bounding box tree construction method on the basis of a linked list sorting balanced binary tree, and belongs to the technical field of software collision detection in virtual reality. An object which needs to establish a bounding box tree is divided into basic geometric primitives according to reasonable accuracy, a corresopnding AABB hierarchical bounding box is generated, a linked list sorting balanced binary tree is created, the created binary tree is traversed, an attribute value is added for each binary tree object in the linked list for storing length from the binary tree to a reference site, and the linked list is subjected to ascending sorting according to the attribute value in the binary tree object in the linked list; the linked list is traversed, the binary trees in the linked list are combined pairwise, and a combination result is stored into the linked list. The height of the tree is lowered by a linked list sorting balanced binarytree method, the repeated sorting problem in a binary tree combination process is solved, time complexity during traversal is lowered, the time consumption of tree construction is saved, and the realtime and the collision detection efficiency of a collision detection process can be improved.

Description

technical field [0001] The invention belongs to the technical field of soft body collision detection in virtual reality, and in particular relates to a hierarchical bounding box tree construction method based on linked list sorting and balanced binary trees. Background technique [0002] Virtual reality (Virtual Reality, referred to as VR) technology is a technology that is being known by more and more people and is developing rapidly. It uses computer hardware, software and networks to generate a three-dimensional environment, and operators use some wearable sensors to The device can interact with it and apply operations to objects in the environment. At the same time, the virtual environment provides simulations of senses such as vision, hearing, touch, smell, and taste, giving people a sense of being there. [0003] The main principle of the bounding box is to use fixed geometry to enclose complex and changeable virtual objects. If you want to judge whether two objects in...

AI Technical Summary

Problems solved by technology

However, the tree height of the hierarchical bounding box tree constructed by 4 nodes in the Huffman method is 4, that is, the tree height of the tree constructed by using the Huffman tree method is O(n) level, and the traversal of the hierarchical bounding box tree is increased. time-consuming

In addition, when using the Huffman coding method to construct a tree, the distance needs to be recalculated and reordered according to the distance after each merge, so constructing the tree is also very time-consuming, and the real-time performance is greatly reduced

[0012] For a balanced binary tree, when searching for a path from the root node to the leaf node, the total workload is the smallest. In addition, whether the hierarchical bounding box tree is balanced, that is, whether the size of each node in the tree is roughly equal It directly affects the computational efficiency of the binary tree. Using Huffman coding to construct the AABB-level bounding box tree requires frequent calculation of distance and sorting, which is complex and difficult to implement.

Images