An unified framework to solve the broad and narrow phases of the collision detection problem in virtual prototype environments

Author(s):  
M. Figueiredo ◽  
T. Fernando
2013 ◽  
Vol 37 (2) ◽  
pp. 185-196 ◽  
Author(s):  
Yu Wang ◽  
Baolin Liu ◽  
Qin Zhou ◽  
Yuanbiao Hu ◽  
Guomin Li

Sonic drilling is a novel sampling technology applied in many fields. Based on SolidWorks software, a dynamics virtual prototyping is utilized to develop a physical sonic driller by demonstrating collision detection and optimizing overall layout and key component structures. Key hydraulic and structural parameters are optimized using a mathematical model. Search for the optimized parameters and operating conditions for this multi-body mechanical system is conducted experimentally. The practical results show that the virtual prototype technology not only shortens the design cycle but also improves the quality of the conventional design. The new sonic driller designed by this method is both environmentally friendly and smarter.


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.


1994 ◽  
Vol 14 (3) ◽  
pp. 36-43 ◽  
Author(s):  
A. Garcia-Alonso ◽  
N. Serrano ◽  
J. Flaquer

2005 ◽  
Vol 5 (1) ◽  
pp. 48-55 ◽  
Author(s):  
Ali Akgunduz ◽  
Prashant Banerjee ◽  
Sanjay Mehrotra

This paper addresses the issue of real-time collision detection between pairs of convex polyhedral objects undergoing fast rotational and translational motions. Accurate contact information between objects in virtual reality based simulations such as product design, assembly analysis, performance testing and ergonomic analysis of products are critical factors to explore when desired realism is to be achieved. For this purpose, fast, accurate and robust collision detection algorithms are required. The method described in the text models the exact collision detection problem between convex objects as a linear program. One of the strengths of the proposed methodology is its capability of addressing high speed interframe collision. In addition to the interframe collision detection, experimental data demonstrate that mathematical programming approaches offer promising results in terms of speed and robustness as well.


Sign in / Sign up

Export Citation Format

Share Document