scholarly journals Research on Bounding Volume Boxes Collision Detection Algorithm in Virtual Reality Technology

2018 ◽  
Vol 3 (2) ◽  
pp. 84-88
Author(s):  
Wan Chao ◽  
Liu Pingping ◽  
Hong Bo
Keyword(s):  
Virtual Reality ◽  
Collision Detection ◽  
Detection Algorithm ◽  
Virtual Reality Technology ◽  
Bounding Volume

A Survey of Collision Detection

2014 ◽  
Vol 538 ◽  
pp. 360-363 ◽  
Author(s):  
Ran Ran Man ◽  
Dong Sheng Zhou ◽  
Qiang Zhang
Keyword(s):  
Virtual Reality ◽  
Particle Swarm Optimization ◽  
Collision Detection ◽  
Detection Algorithm ◽  
Detection Problem ◽  
Swarm Optimization ◽  
Bounding Volume ◽  
Bounding Volume Hierarchies ◽  
Efficiency And Reliability ◽  
Research Situation

The interference and collision detection problem among objects is widely studied in graphics, simulation, animation and virtual reality technologic. In this paper, we proceed from the main solution for collision detection, analyzed from graphic space, bounding volume hierarchies (BVH), Particle Swarm Optimization (PSO) and parallel algorithm, summarized the research situation about collision detection in recent years. At last, we give several suggestions to improve the efficiency and reliability of the collision detection algorithm.

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.

Towards a Virtual Reality Simulator for Orthognathic Basic Skils

2012 ◽  
Vol 162 ◽  
pp. 352-357 ◽  
Author(s):  
Raluca Elena Sofronia ◽  
Arjana Davidescu ◽  
George Gustav Savii
Keyword(s):  
Virtual Reality ◽  
Collision Detection ◽  
Orthognathic Surgery ◽  
Nerve Lesion ◽  
Virtual Reality Technology ◽  
Non Union ◽  
Bounding Volumes ◽  
Saw Blade ◽  
High Level ◽  
Arthroplasty Surgery

Bone sawing skill demands a high level of dexterity from the surgeon that can be achieved only with a lot of training. Sawing is a basic skill required in many procedures, such as: osteotomy, ostectomy, amputation and arthroplasty surgery. Inefficient sawing can lead in orthognathic surgery to nerve lesion, bad split and non-union. Using virtual reality technology this complications can be reduced, by training the students on simulators until they assimilate the skill. This paper presents an early prototype for a bone sawing simulator in orthognathic surgery. A voxel-based mandible model obtained from a Computer Tomography is cut by removing the voxels that are inside the saw blade. The collision detection is based on hierarchical bounding volumes. The removal process is observed both visually and haptically.

Research on the Collision Detection Technology of Coal-Cutting Machinery in Remote Virtual Control

2015 ◽  
Vol 738-739 ◽  
pp. 863-866 ◽  
Author(s):  
Ai Ling Qi ◽  
Huan Wang ◽  
Hai Yan Wu ◽  
Hong Wei Ma
Keyword(s):  
Virtual Reality ◽  
Collision Detection ◽  
Detection Algorithm ◽  
Virtual Reality System ◽  
Virtual Scene ◽  
Bounding Volumes ◽  
Virtual Control ◽  
Coal Cutting ◽  
Detection Technology ◽  
Mine Automation

On account of the dangerousness of coal mining, the remote virtual control of coal-cutting machinery is the development direction of coal mine automation, and collision detection is a crucial technology of virtual reality system. In order to solve the problems about through the wall during virtual scene walkthrough in virtual control of coal-cutting machinery, this paper has researched collision detection algorithm, according to the characteristics of coalface and virtual reality system scene, taking advantage of hierarchical bounding volumes algorithm to solve the collision detection problems of coalface in virtual reality system. And it has compiled the algorithm by applying SDK of Quest3D software. Research results show that, realization of the collision detection algorithm has solved scene roaming simulation degree and the speed of the system in coalface virtual scene walkthrough.

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.

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.

scholarly journals Collision Detection for Point Cloud Models With Bounding Spheres Hierarchies

2012 ◽  
Vol 11 (2) ◽  
pp. 37-43
Author(s):  
Mauro Figueiredo ◽  
João Pereira ◽  
João Oliveira ◽  
Bruno Araújo
Keyword(s):  
Collision Detection ◽  
Point Cloud ◽  
Complex Geometry ◽  
Shape Representation ◽  
Three Dimensional ◽  
Detection Algorithm ◽  
Empty Cell ◽  
Cloud Models ◽  
Bounding Volume ◽  
Common Shape

Point cloud models are a common shape representation for several reasons. Three-dimensional scanning devices are widely used nowadays and points are an attractive primitive for rendering complex geometry. Nevertheless, there is not much literature on collision detection for point cloud models. This paper presents a novel collision detection algorithm for large point cloud models using voxels, octrees and bounding spheres hierarchies (BSH). The scene graph is divided in voxels. The objects of each voxel are organized intoan octree. Due to the high number of points in the scene, each non-empty cell of the octree is organized in a bounding sphere hierarchy, based on an R-tree hierarchy like structure. The BSH hierarchies are used to group neighboring points and filter out very quickly parts of objects that do not interact with other models. Points derived from laser scanned data typically are not segmented and can have arbitrary spatial resolution thus introducing computational and modeling issues. We address these issues and our results show that the proposed collision detection algorithm effectively finds intersections between point cloud models since it is able to reduce the number of bounding volume checks and updates

A Collision Detection Algorithm Based on Spatial Partitioning and Bounding Volume

2013 ◽  
Vol 433-435 ◽  
pp. 932-935
Author(s):  
Wei Zhao ◽  
Li Ming Ye
Keyword(s):  
Real Time ◽  
Collision Detection ◽  
Detection Algorithm ◽  
Spatial Partitioning ◽  
The Real ◽  
Bounding Volume ◽  
Detection Technology ◽  
Bounding Boxes ◽  
Intersection Test ◽  
Rule Out

In order to improve the real-time and accuracy in the collision detection technology, a collision detection algorithm based on spatial partitioning and bounding volume was proposed . This algorithm adopted different spatial division strategies for different locations of the spaces according to the details in the scenes to exclude objects which can not intersect.Thus defined the potential intersection areas. Then we used a dynamic S-AABB hierarchy bounding boxes to test whether the intersection happened between the objects in the same grids. We used the sphere boxes to rule out the disjoint objects quickly. Then constructed the dynamic AABB bounding boxes trees for the rest of objects for further intersection test. At last, we improved the traditional overlapping test between the primitives for accurate collision detection . Compared to the traditional collision detection algorithm based on spatial partitioning and AABB bounding volume. This algorithm effectively improves the real-time of the collision detection without affecting the accuracy of original collision detection.

Sign in / Sign up

Export Citation Format

Share Document