Distance Computation between Convex Objects using Axis-Aligned Bounding-Box in Virtual Environment Application

Performing collision detection between convex objects in virtual environment simulation is one of vital problems in computer visualization research area. Given a set of two or more colliding objects, in order to determine the exact point of contact between object we need to undergo various high computation algorithm. In this paper, we describes our current work of determining the precise contact by measuring the distance between near colliding objects in order to maintain the accuracy and improve the speed of collision detection algorithm. Common method determine the distance by checking for vertices and edges point between objects in brute force condition. Compared to our method, by given set of objects in virtual environment world, we find the closest point between near colliding objects and bound the potential colliding area with an Axis-Aligned Bounding-Box. Then, we approximate the distance by measuring the distance of the box itself and hence recognize potential colliding area faster than the common method. Our method proven to most effective and efficient for narrow phase collision detection by removing unnecessary testing and reduced computational cost

Fast Penetration Depth Estimation for Elastic Bodies

We present a fast penetration depth estimation algorithm between deformable polyhedral objects. We assume the continuum of non-rigid models are discretized using standard techniques, such as finite element or finite difference methods. As the objects deform, the pre-computed distance fields are deformed accordingly to estimate penetration depth, allowing enforcement of non-penetration constraints between two colliding elastic bodies. This approach can automatically handle self-penetration and inter-penetration in a uniform manner. We demonstrate its effectiveness on moderately complex simulation scenes

Distance Computation using Axis Aligned Bounding Box (AABB) Parallel Distribution of Dynamic Origin Point

Performing accurate and precise collision detection method be-tween objects in virtual environment application such as computer games and medical simulation is important in computer graphics research and development. Given pair of objects that near colliding, numerous mechanic has been developed by researchers in order to minimize computation time and increase accuracy of the detection. However, most of these techniques required a lot of computational cost, extra processing power and complex algebraic equations just to solve distance between near colliding objects. In this paper, we described an alternate technique, which is a theoretical framework of novel technique in order to find the optimum closest distance between two or more convex polyhedral in virtual environment application. Given pair of near colliding objects, we proposed an easy to implement mechanism using dynamic origin point by creating inner and middle Axis Aligned Bounding-Box just to find closest distance between objects. We believed that the technique is suitable to be used in any game engine tools for computer games and medical simulation

Measuring Distance between Nearly Intersected Objects in Narrow Phase Collision Detection

Calculating the distance between two or more object primitives (or triangles) in virtual environment application before collision occurs is important elements in narrow phase collision detection system. Given pairs of nearly colliding objects, their triangles must be checked one by one until the most shortest distance is founded and thus the computation cost for checking collision reduced by checking the nearest triangles that possible to collide. Hence, in this research, we used Heron’s formula for calculating the distance between objects that nearly collide and compared it using vector-based calculation. We have found that the formula increased the speed of distance computation slightly faster compared to the vector-based calculation for single triangle checking with minimum memory requirements. In this paper, we explained the procedures of using Heron’s Formula and vector-based techniques for computing distance and the experimental results between those two techniques. It is believed that it could help to speed up the process of determine the precise contact between colliding objects while maintaining the accuracy of the collision checkin

Bounding Volume Hierarchies for Collision Detection

In virtual environment world, performing collision detection between various 3D objects requires sophisticated steps to be followed in order to properly visualize their effect. It is challenging due to the fact that multiple objects undergo various motion depending on the application’s genre. It is however an essential challenge to be resolved since it’s many use in the computer animation, simulation and robotic industry. Thus, object intersection between rigid bodies has become one of the most important areas in order to bring realism to simulation and animation

GPU-based proximity query processing on unstructured triangular mesh model

This paper presents a novel proximity query (PQ) approach capable to detect the collision and calculate the minimal Euclidean distance between two non-convex objects in 3D, namely the robot and the environment. Such approaches are often considered as computationally demanding problems, but are of importance to many applications such as online simulation of haptic feedback and robot collision-free trajectory. Our approach enables to preserve the representation of unstructured environment in the form of triangular meshes. The proposed PQ algorithm is computationally parallel so that it can be effectively implemented on graphics processing units (GPUs). A GPU-based computation scheme is also developed and customized, which shows >200 times faster than an optimized CPU with single core. Comprehensive validation is also conducted on two simulated scenarios in order to demonstrate the practical values of its potential application in image-guided surgical robotics and humanoid robotic control.published_or_final_versio

Efficient continuous collision detection for bounding boxes under rational motion

This paper presents a simple yet precise and efficient algorithm for collision prediction of two oriented bounding boxes under univariate (piecewise) rational motion. We present an analytic solution to the problem of finding the time of collision and the feature involved, or declaring that no collision should occur. Our solution can be applied to boxes of any size, under arbitrary rational rigid motion. The algorithm is based on the efficient examination of the Minkowski sum (MS) of the two boxes, using a spherical Gauss map dual representation, and a precise extraction of the collision time, if any, as a solution to a set of rational equations that are automatically derived. © 2006 IEEE.published_or_final_versio