Ray Casting against General Convex Objects with Application to Continuous Collision Detection
نویسنده
چکیده
This paper presents a new algorithm for computing the hit point and normal of a ray and a general convex object. The algorithm is loosely based on the the Gilbert-Johnson-Keerthi algorithm for computing the distance between convex objects in the sense that it is applicable to the same family of convex objects and uses the same subalgorithm for computing the closest point of a simplex. Since this family of convex objects includes objects constructed by Minkowski addition, this algorithm can be used for finding the earliest time two objects that move at a constant linear velocity come in contact of one another. In this way, this ray-casting algorithm is applicable to a simplified form of continuous collision detection.
منابع مشابه
Efficient Collision Detection
of the Dissertation E cient Collision Detection for Interactive 3D Graphics and Virtual Environments by James Thomas Klosowski Doctor of Philosophy in Applied Mathematics and Statistics State University of New York at Stony Brook 1998 Collision detection is of paramount importance for many applications in computer graphics and visualization. Typically, the input to a collision detection algorit...
متن کاملCInDeR: Collision and Interference Detection in Real-time using graphics hardware
Collision detection is a vital task in almost all forms of computer animation and physical simulation. It is also one of the most computationally expensive, and therefore a frequent impediment to efficient implementation of real-time graphics applications. We describe how graphics hardware can be used as a geometric co-processor to carry out the bulk of the computation involved with collision d...
متن کاملConvex hull covering of polygonal scenes for accurate collision detection in games
Decomposing a complex object into simpler pieces, e.g., convex patches or convex polyhedra, is a well-studied geometry problem. A well constructed decomposition can greatly accelerate collision detection since intersections with and between convex objects are fast to compute. In this paper, we look at a particular instance of the convex decomposition problem which arises from real-world game de...
متن کاملComputing Distances between NURBS-defined Convex Objects
Computing the distance between modelled objects is proving to be a fundamental operation for solving many problems in robotics and elsewhere. Most of the previous work in this area has focused on computing the distance between polyhedra, as the problem is easier to solve than the general case and the answer is suucient for many problems. Here we focus on computing the distance between convex ob...
متن کاملHaptic Rendering of Volume Data with Collision Detection Guarantee Using Path Finding
In this paper we present a novel haptic rendering method for exploration of volumetric data. It addresses a recurring flaw in almost all related approaches, where the manipulated object, when moved too quickly, can go through or inside an obstacle. Additionally, either a specific topological structure for the collision objects is needed, or extra speed-up data structures should be prepared. The...
متن کامل