Application Of Collision Detection Research Articles

Real-time collision detection between general SDFs

Signed Distance Fields (SDFs) have found widespread utility in collision detection applications due to their superior query efficiency and ability to represent continuous geometries. However, little attention has been paid to calculating the intersection of two arbitrary SDFs. In this paper, we propose a novel, accurate, and real-time approach for SDF-based collision detection between two solids, both represented as SDFs. Our primary strategy entails using interval calculations and the SDF gradient to guide the search for intersection points within the geometry. For arbitrary objects, we take inspiration from existing collision detection pipelines and segment the two SDFs into multiple parts with bounding volumes. Once potential collisions between two parts are identified, our method quickly computes comprehensive intersection information such as penetration depth, contact points, and contact normals. Our method is general in that it accepts both continuous and discrete SDF representations. Experiment results show that our method can detect collisions in high-precision models in real time, highlighting its potential for a wide range of applications in computer graphics and virtual reality.

Application of Collision Detection in Arjuna's Adventure Game

This research makes how to build a 2 dimensional game with the theme of a young man named Arjun who is on the battlefield and is attacked by "Buto Ijo's troops and must go through attacks from Buto Ijo's troops to protect the “Banakeling” kingdom. The background in taking the theme Arjuna game with side scrolling game to make this game easy to play. In game research that was built using the stages of multimedia development and also using the collision detection method. The Arjuna’s Adventure Game is built based on Android. The design system in this study uses a flowchart. Testing is done with the White Box and Black Box.

Toward Optimal MEC Resource Dimensioning for a Vehicle Collision Avoidance System: A Deep Learning Approach

Collision detection and avoidance between vehicles is one of the key services envisioned in the Internet of Vehicles. Such services are usually deployed at the multi-access edge computing (MEC) to ensure low-latency communication and thus guarantee real-time reactions to avoid collisions between vehicles. In order to maximize the coverage of the road and ensure that all vehicles are connected to an optimal MEC host (in terms of geographical location), the collision avoidance application needs to be instantiated on all the MEC hosts. This may add a burden on the computing resources available at the latter. In this article, we propose an AI-empowered framework that aims to optimize the computing resources at the MEC hosts. Our framework uses deep learning to predict the vehicle density to be served by a MEC host and derive the exact computing resources required by the collision detection application to run optimally. We evaluate the proposed framework using a real dataset representing vehicle mobility in a big city. Obtained results show the accuracy of our prediction model, and hence the efficiency of our resources assignment framework to exactly deduce the optimal computing resources needed by each instance of the application.

Development and clinical implementation of eclipse scripting-based automated patient-specific collision avoidance software.

PurposeIncreased use of Linac‐based stereotactic radiosurgery (SRS), which requires highly noncoplanar gantry trajectories, necessitates the development of efficient and accurate methods of collision detection during the treatment planning process. This work outlines the development and clinical implementation of a patient‐specific computed tomography (CT) contour‐based solution that utilizes Eclipse Scripting to ensure maximum integration with clinical workflow.MethodsThe collision detection application uses triangle mesh structures of the gantry and couch, in addition to the body contour of the patient taken during CT simulation, to virtually simulate patient treatments. Collision detection is performed using Binary Tree Hierarchy detection methods. Algorithm accuracy was first validated for simple cuboidal geometry using a calibration phantom and then extended to an anthropomorphic phantom simulation by comparing the measured minimum distance between structures to the predicted minimum distance for all allowable orientations. The collision space was tested at couch angles every 15° from 90 to 270 with the gantry incremented by 5° through the maximum trajectory. Receiver operating characteristic curve analysis was used to assess algorithm sensitivity and accuracy for predicting collision events. Following extensive validation, the application was implemented clinically for all SRS patients.ResultsThe application was able to predict minimum distances between structures to within 3 cm. A safety margin of 1.5 cm was sufficient to achieve 100% sensitivity for all test cases. Accuracy obtained was 94.2% with the 5 cm clinical safety margin with 100% true positive collision detection. A total of 88 noncoplanar SRS patients have been currently tested using the application with one collision detected and no undetected collisions occurring. The average time for collision testing per patient was 2 min 58 s.ConclusionsA collision detection application utilizing patient CT contours was developed and successfully clinically implemented. This application allows collisions to be detected early during the planning process, avoiding patient delays and unnecessary resource utilization if detected during delivery.

Vehicle Collision Detection Application Through Collision Video Files with Quadtree Algorithms

The improvement of digital image processing technology is increasingly rapid. Image processing has been widely used to maximize the usefulness of the webcam interface or CCTV, which can be used to monitor traffic flow on the street. One of the frequent event occure on the street is a crash (collision). This problem often arises in a collision event is a dispute about the party guilty in the collision. A collision detection application using Quadtree algorithm can solve this problem. This study aims to analyze and design intelligent systems for vehicle collision detection on street through a webcam camera. Using the Quadtree algorithm, a collisions that occur on vehicles can be detected by the regions division method such ash Quadtree algorithm. Using this application the collision possibilities can be describe. Based on the results of the tests conducted, information was obtained that the accuracy of the application of the Quadtree algorithm in the detection of car collisions on the highway was 8: 2 where the value was obtained from the number of collisions detected.

Research and Application of Collision Detection on Steel Structure in Virtual Pre-Assembly Environment

In order to detect the possible collision of steel structural in virtual pre-assembly environment, a collision detection program based on the bounding box algorithm and the spatial triangle intersection detection algorithm was developed. And the feasibility and effectiveness of the collision detection program in virtual pre-assembly were verified by an example. The results showed that: according to this method, the collision detection in virtual pre-assembly has good feasibility and is suitable to practical projects.

A Bounding Box Collision Detection Method Based On The Android System For Adventure Game

The purpose of this research is to create, design and develop “Star Ship Adventure” game using a bounding box collision detection method. This game is expected to be entertaining and fun to play in leisure time. It will be able to be built on Android device. The application of collision detection in games is used to detect collisions between objects in the game. This game is built using Android SDK (Software Development Kit), Android Development Tools, and Eclipse IDE using the Java programming language. Research results have shown that the player’s plane can read and detect collisions with enemy’s plane objects. The bounding box collision detection technique occurs when a player’s plane is able to estimate the distance of an enemy object. When the player moves in the enemy’s bounding box range, the detection occurs. As a result, the plane does not penetrate against the enemy.

Haptic Collision Detection on Disjoint Objects with Overlapping and Inclusive Bounding Volumes.

This paper presents a method to alleviate performance degradation issues of Haptic Collision Detection when the Bounding Volumes or Bounding Volume Hierarchies of multiple disjoint objects are overlapping or inclusive and force the Haptic Collision Detection methods into narrow phase collision detection with all involved objects. The proposed method aims to generate tighter, mutually exclusive Bounding Volumes at the pre-processing stage, and to quickly cull irrelevant nearby objects at the broad phase to ensure that the Haptic Collision Detection methods will not be overloaded with unnecessary narrow phase collision detection. The proposed method is based on a hybrid representation of Bounding Volume and Space Partitioning and is implemented as an algorithm that automatically generates these new Bounding Volumes for disjoint objects, with details and corner cases discussed. A series of experiments based on real-life Haptic Collision Detection applications has been conducted. The results are analyzed and compared with those from an existing Haptic Collision Detection algorithm. The outcome demonstrates the capability of the proposed method in maintaining a stable Haptic Collision Detection performance under various challenging situations.

Tessellations in GIS: Part II–making changes

We attempt to describe the role of tessellated models of space within the discipline of Geographic Information Systems (GIS) – a speciality coming largely out of Geography and Land Surveying, where there was a strong need to represent information about the land’s surface within a computer system rather than on the original paper maps. We look at some of the basic operations in GIS, including dynamic and kinetic applications. We examine issues of topology and data structures, and produced a tessellation model that may be widely applied both to traditional “object” and “field” data types. The Part I of this study examined object and field spatial models, the Voronoi extension of objects, and the graphs that express the resulting adjacencies. The required data structures were also briefly described, along with 2D and 3D structures and hierarchical indexing. The importance of graph duality was emphasized. Here, this second paper builds on the structures described in the first, and examines how these may be modified: change may often be associated with either viewpoint or time. Incremental algorithms permit additional point insertion, and applications involving the addition of skeleton points, for map scanning, contour enrichment or watershed delineation and simulation. Dynamic algorithms permit skeleton smoothing, and higher order Voronoi diagram applications, including Sibson interpolation. Kinetic algorithms allow collision detection applications, free-Lagrange flow modeling, and pen movement simulation for map drawing. If desired these methods may be extended to 3D. Based on this framework, it can be argued that tessellation models are fundamental to our understanding and processing of geographical space, and provide a coherent framework for understanding the “space” in which we exist.

Research and Application of Collision Detection in Virtual Roam based on WebGL and HTML5

Research and Application of Collision Detection in Virtual Roam based on WebGL and HTML5

Revisión de literatura de jerarquía volúmenes acotantes enfocados en detección de colisiones

A bounding volume is a common method to simplify object representation by using the composition of geometrical shapes that enclose the object; it encapsulates complex objects by means of simple volumes and it is widely useful in collision detection applications and ray tracing for rendering algorithms. They are popular in computer graphics and computational geometry. Most popular bounding volumes are spheres, Oriented-Bounding Boxes (OBB’s), Axis-Aligned Bounding Boxes (AABB’s); moreover, the literature review includes ellipsoids, cylinders, sphere packing, sphere shells,k-DOP’s, convex hulls, cloud of points, and minimal bounding boxes, among others. A Bounding Volume Hierarchy is usually a tree in which the complete object is represented tighter fitting every level of the hierarchy. Additionally, each bounding volume as a cost associated to construction, update, and interference tests. For instance, spheres are invariant to rotation and translations, then they do not require being updated; their constructions and interference tests are more straightforward then OBB’s; however, their tightness is lower than other bounding volumes. Finally, three comparisons between two polyhedra; seven different algorithms were used, of which five are public libraries for collision detection.

Implementation and Evaluation of Local Dynamic Map in Safety Driving Systems

Cooperative safety driving systems using vehicle-to-vehicle and vehicle-to infrastructure communication are developed. Sensor data of vehicles and infrastructures are communicated in the cooperative safety driving system. LDM (Local Dynamic Map) is standardized by ETSI (European Telecommunications Standards Institute) to manage the vehicle sensor data and the map data. Implementations of LDM are reported on documents of ETSI, but there are no numerical results. The implementations of LDM are deployed the database management system. We think that the response time of the database becomes higher as the number of vehicles grows. In this paper, we have implemented and evaluated the LDM with the collision detection application.

Collision Detection Application for Virtual and Augmented Reality Aided Manufacturing System

Virtual reality is one of the most challenging technologies nowadays and it shows great promises for its usage in engineering field. Paper develops application of detection module in virtual reality system. It discusses function, integration and also operation of such module within the system together with description of system architecture. It shows integration of this module into simulation loop with defining necessary parameters for module operating.

Application of Collision Detection in Visual Simulation System for Bridge Cranes

Collision detection is the key technology in the visual simulation system for bridge cranes. According to analyse the collision between hook and virtual objects in visual simulation system for bridge cranes, collision detection method of visual simulation system for bridge cranes is determined based on the collision detection principle. First of all, LOS intersection vector method is chosen based on the principle of collision detection in Vega. Hook is designed for the collision target using Isector module in Lynx and the same intersection vector masks in Isector Class are guaranteed. Then, the BUMP collision detection for hook is created by calling vgIsector functions in VC++ and BUMP detection method of hook is bounded with hook. Finally, conditional statements which ensure hook to move without collision are compiled. Therefore, the virtual scene around the hook is detected in real time. The results show that the phenomenon of passing through by mistake for the hook can be avoided applying the BUMP collision detection method in Vega software in visual simulation system for bridge cranes, and the accuracy for BUMP method detecting the goods is improved using LOS collision detection method.

Octree-based hierarchical distance maps for collision detection

In this paper, we propose a novel hierarchical representation for discretized distance maps commonly used in robotics for path planning and collision detection applications. We augment the well-known octree structure for representing distance maps in a hierarchical manner. Our augmented octree based representation drastically reduces the expensive memory requirement compared to voxel-based distance maps while providing substantially better collision-detection performance than by using unaugmented octrees. Although our main motivation has been collision detection in robotics, similar octree distance maps will have wide applications in many other areas including machine vision, computer graphics and so on.