Hubbard, P. M., "Space-Time Bounds for Collision Detection," Tech. Report CS-93-04, Department of Computer Science, Brown University, February 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Rapid Simulation of Proximal-Interaction Particle Systems - Popovic (1994) (1 citation) (Correct)
....subdivision into a discrete event framework, and reports significant performance improvement. Our work is in part motivated by his simulation technique. Recently, a considerable effort has been made to use the discrete event theory to improve the performance of collision detection simulations [13, 5, 9]. All such methods take advantage of trajectory bounds derived from the limits on velocity or acceleration of particles. Of course, they heavily rely on the availability of those bounds which detracts from the applicability and generality of the method. In simulations of complex natural phenomena ....
Philip M. Hubbard. Space-time bounds for collision detection. Technical Report CS-93-04, Computer Science Department, Brown University, 1993.
Evaluation of Collision Detection Methods for Virtual.. - Held, Klosowski.. (1995) (34 citations) (Correct)
....tracking the closest pairs of points between all pairs of convex pieces. This method is highly effective as long as there are not too many convex pieces involved; it has the advantage of not relying on any of the objects remaining stationary. Other work includes [13] and the thesis work of Hubbard [17, 18], who uses approximations of objects (covering by disks) to speed up collision detection. Very recent papers include [19] and [27] An Application to VR in Aircraft Manufacturing We were drawn into this line of research when the Boeing VR group came to us with a problem: How can one do ....
P.M. Hubbard. Space-time bounds for collision detection. Technical Report CS-93-04, Dept. of Computer Science, Brown University, February 1993.
Interactive Collision Detection - Hubbard (1993) (45 citations) Self-citation (Hubbard) (Correct)
....of A at t. Say we know x(0) x(0) and a scalar M such that j x(t)j M; 0 t t: From this upper bound we can conclude that jx(t) Gamma [x(0) x(0)t]j M 2 t 2 ; 0 t t: 1) This assertion is related to Taylor s theorem; a proof is not difficult and we present it elsewhere [8]. The importance of Inequality 1 comes from its geometric interpretation. The inequality states that the position of A at time t will be within a distance (M=2)t 2 from the point x(0) x(0)t. Thus, a 3D bound on the position of A at t is a sphere of radius (M=2)t 2 centered at x(0) x(0)t. ....
....to t i . It should be intuitively clear that this approach solves the fixed timestep weakness. Section 6 presents the precise statement of this approach. The current section sketches how to compute t i while avoiding the all pairs weakness; the details of this computation can be found elsewhere [8]. The main source of complexity in the intersection algorithm is the presence of cutting planes in spacetime bounds. We simplify the algorithm by observing that an intersection between two hyper trapezoid faces is a necessary condition for any sort of intersection between two space time bounds. A ....
[Article contains additional citation context not shown here]
Hubbard, P. M., "Space-Time Bounds for Collision Detection," Tech. Report CS-93-04, Department of Computer Science, Brown University, February 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC