Study Based on Hybrid Bounding Volume Hierarchy for Collision Detection in the Virtual Manipulator

2013 ◽  
Vol 454 ◽  
pp. 74-77 ◽  
Author(s):  
Hong Yu Wu ◽  
Zhi Meng Shu ◽  
Yong Guang Liu
Keyword(s):  
Collision Detection ◽  
Simple Algorithm ◽  
Detection Algorithm ◽  
Complex Objects ◽  
Detection Model ◽  
Bounding Volume ◽  
Hydraulic Servo ◽  
On Line ◽  
Simulation Problem ◽  
Bounding Volume Hierarchy

A collision detection algorithm based on hybrid bounding volume hierarchy was proposed using k-DOPs and sphere between complex objects. A simple algorithm to the particular structure of hydraulic servo manipulator was introduced based on the relation of line to line and line to plane to deal with real time collision detection between graphicrobot and operation task in consideration of the bounding volume hierarchy method.Validity of thisalgorithm was proved through experiments . The experimental results show that the proposed collision detection model is simple and fast in calculation,and easy for realization.it can solve on line simulation problem in remote operation for construction robot,and could be applied in simple virtual reality system.

DESIGN AND APPLICATION OF BOUNDING VOLUME HIERARCHY COLLISION DETECTION ALGORITHM BASED ON VIRTUAL SPHERE

2019 ◽  
Vol 19 (07) ◽  
pp. 1940044
Author(s):  
MONAN WANG ◽  
SHAOYONG CHEN ◽  
QIYOU YANG
Keyword(s):  
Collision Detection ◽  
Detection Efficiency ◽  
Vastus Lateralis ◽  
Detection Algorithm ◽  
Virtual Surgery ◽  
Vastus Lateralis Muscle ◽  
Detection Algorithms ◽  
Bounding Volume ◽  
High Detection Efficiency ◽  
Bounding Volume Hierarchy

The result of collision detection is closely related to the further deformation or cutting action of soft tissue. In order to further improve the efficiency and stability of collision detection, in this paper, a collision detection algorithm of bounding volume hierarchy based on virtual sphere was proposed. The proposed algorithm was validated and the results show that the detection efficiency of the bounding volume hierarchy algorithm based on virtual sphere is higher than that of the serial hybrid bounding volume hierarchy algorithm and the parallel hybrid bounding volume hierarchy algorithm. Different collision detection algorithms were tested and the results show that the collision detection algorithm based on virtual sphere has high detection efficiency and good stability. As the number of triangular patches increased, the advantage was more and more obvious. Finally, the proposed algorithm was applied to two large and medium-sized virtual scenes to implement the collision detection between the vastus lateralis muscle, thigh and surgical instrument. Based on the virtual sphere, the collision detection algorithm of bounding volume hierarchy can implement efficient and stable collision detection in a virtual surgery system. Meanwhile, the algorithm can be combined with other acceleration algorithms (such as the multithread acceleration algorithm) to further improve detection efficiency.

An Optimized Collision Detection Algorithm Based on Dynamic Bounding Volume Tree

2013 ◽  
Vol 846-847 ◽  
pp. 1372-1375
Author(s):  
Wei Zhao ◽  
Li Ming Ye
Keyword(s):  
Real Time ◽  
Collision Detection ◽  
Detection Algorithm ◽  
The Real ◽  
Bounding Volume

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.

Efficient collision detection using a dual OBB-sphere bounding volume hierarchy

2010 ◽  
Vol 42 (1) ◽  
pp. 50-57 ◽  
Author(s):  
Jung-Woo Chang ◽  
Wenping Wang ◽  
Myung-Soo Kim
Keyword(s):  
Collision Detection ◽  
Bounding Volume ◽  
Bounding Volume Hierarchy

Research on Scene Organize Algorithm Based on BVH with Dynamic Rendering Tree

2014 ◽  
Vol 596 ◽  
pp. 370-373
Author(s):  
Li Xu ◽  
Mao Zhen Liu
Keyword(s):  
Real Time ◽  
Collision Detection ◽  
Visual Effect ◽  
The Real ◽  
Scale Factors ◽  
Bounding Volume ◽  
Scene Management ◽  
Tree Construction ◽  
3D Scene ◽  
Bounding Volume Hierarchy

: The real-time rendering of 3D scene need excellent algorithm to support scene management. After considering the algorithm complexity and scene scale factors, combining the advantages of Bounding Volume Hierarchy (BVH) and rendering tree in scene management, this paper puts forward a kind of scene organize algorithm, to solve the problem of render states redundant calculation when using BVH technology to solve the problem of deformable collision detection, by choosing the appropriate strategy of Hierarchy Bounding Volume tree construction and optimizing rendering tree of the scene. Experiments prove the proposed algorithm can effectively improve the rendering efficiency of 3D scene, enhance the visual effect.

Collision Detection Algorithm of Belt Grinding of the Blisk Based on Improved Octree Segmentation Method

2021 ◽  
Author(s):  
Zhi Huang ◽  
Xing Yang ◽  
Jie Min ◽  
Hongyan Wang ◽  
Pengxuan Wei
Keyword(s):  
Collision Detection ◽  
Clustering Algorithm ◽  
Detection Algorithm ◽  
Segmentation Method ◽  
Belt Grinding ◽  
Detection Model ◽  
Detection Algorithms ◽  
Bladed Disk ◽  
Abrasive Belt ◽  
Algorithm Verification

Abstract In the process of belt grinding aero-engine Blisk(Bladed Disk), the abrasive belt can easily interfere with the Blisk, which will damage the valuable Blisk. Therefore, it is indispensable and significant to study the collision detection of belt grinding the Blisk. However, the application of traditional collision detection algorithms in this complicated realistic scene is difficult to obtain satisfactory results. In order to improve the accuracy and efficiency of the collision detection of grinding the Blisk, a collision detection algorithm based on the improved octree segmentation method is proposed in this paper. Firstly, the Oriented Bounding Box (OBB) is applied to establish the collision detection model for the abrasive belt. Secondly, the traditional octree segmentation method is optimized based on the k-means clustering algorithm, and an improved octree segmentation method is presented, in addition, the flow chart of the collision detection algorithm for belt grinding of the Bliskis given. Finally, algorithm verification and experimental verification are carried out based on a certain type of the Blisk. The results suggest that compared with the traditional method, the method in this paper not only promotes the accuracy of collision detection, but also promotes the efficiency of collision detection, and meets the requirements of object collision detection in this tanglesome scene with both accuracy and speed.

Sign in / Sign up

Export Citation Format

Share Document