On the Collision Detection Problem of Two Moving Objects Described by Algebraic Sets

2007 ◽  
Vol 20 (1) ◽  
pp. 108-118 ◽  
Author(s):  
Shurong Li ◽  
Chunwang Hou
Author(s):  
Heming Yang ◽  
Xinfang Zhang ◽  
Ji Zhou ◽  
Jun Yu

Abstract Collision and interference detection among 3-D moving objects is an important issue in the simulation of their behavior. This paper presents a new model for representing 3-D objects and a corresponding effective algorithm for detecting collisions and interferences among moving objects. Objects can be represented for efficient collision and interference detection by a hierarchy of oct - sphere model (HOSM). Algorithms are given for building the HOSM and for detecting collisions and interferences between moving objects. On the basis of HOSM, the algorithm checks only intersections between the nodes of the models which are on the surfaces of the objects. Furthermore, because a node of HOSM represents a spherical region, the collision between the two nodes can be easily found just by calculating the distance between the centers of the two spheres corresponding to them no matter how the objects move. Finally, we discuss the efficiency of the algorithm through an example.


1995 ◽  
Vol 26 (2) ◽  
pp. 189-210 ◽  
Author(s):  
Mark Gill ◽  
Albert Zomaya

2005 ◽  
Vol 15 (04) ◽  
pp. 351-377 ◽  
Author(s):  
RON WEIN ◽  
OLEG ILUSHIN ◽  
GERSHON ELBER ◽  
DAN HALPERIN

We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter continuously moves near the workpiece. Having five degrees of motion freedom, this problem is hard to solve exactly and we approximate the motion of the tool by a sequence of sub-paths of pure translations interleaved with pure rotations. The collision-detection problem along each sub-path is then solved by using radial projection of the obstacles (the workpiece and the static parts of the NC-machine) around the tool axis to obtain a collection of critical surface patches in ℝ3, and by examining planar silhouettes of these surface patches. We thus reduce the problem to successive computations of the lower envelope of a set of planar curves, which we intersect with the profile of the tool. Our reduction is exact, and incurs no loss of accuracy. We have implemented our algorithm in the IRIT environment for solid modeling, using an extension package of the CGAL library for computing envelopes. The algorithm, combined with the proper data structures, solves the collision detection problem in a robust manner, yet it yields efficient computation times as our experiments show. Our approach produces exact results in case of purely translational motion, and provides guaranteed (and good) approximation bounds in case the motion includes rotation.


2015 ◽  
Vol 713-715 ◽  
pp. 411-414
Author(s):  
He Qun Qiang ◽  
Chun Hua Qian

The collision detection problem is a classical problem in computer graphics research field. It has become a hot topic in recent years with the development of virtual assembly technology. And accurate collision detection is crucial to improve the reliability and authenticity of virtual assembly. In this paper, we designed a collision detection algorithm with a pre-segment strategy based on OBB-Tree algorithm, took advantage of the shape characteristics of component model, used a smaller bounding box for operation. Experimental results showed that the efficiency of the algorithm is about 10% higher than that of traditional OBB-Tree algorithm.


Author(s):  
Kao-Shing Hwang ◽  
Ming-Dar Tsai ◽  
Ming-Yi Ju

Abstract A 3-D collision-free trajectory planning method for a mobile robot is proposed in the paper. The geometric shapes of the objects in the workspace are modeled as ellipsoids of 3-D quadric model for simple mathematical representation and easy geometric approximation. By a series of coordinate transformations between the mobile robot and obstacles, the collision detection problem in trajectory planning is reduced to test a point falling outside or inside the transformed ellipsoids, which models obstacles geometrically. Finally, the collision probability, which is defined by projecting the quadric ellipsoid onto a 3-D Gaussian distribution contour, plays a very significant role in search the optimal path through the defined objective function.


Author(s):  
Cheng-fu Chen

A new method for formulation, solution, and sensitivity analysis of collision detection of convex objects in motion is presented. The collision detection problem is formulated as a parametric programming problem governed by the changes in the relative translation and relative rotation between the two objects considered. The two parameters together determine all the possible relative configurations between two moving convex objects. Therefore, solving this parametric problem allows for knowing the proximity information for all the possible configurations of the objects. We develop a two-step decomposition procedure to solve this parametric programming problem, and show that the solution is a convex function of the two parameters. This convexity feature enables an archive of the proximity information and sensitivity analysis for the collision detection problem.


Sign in / Sign up

Export Citation Format

Share Document