G. Zachmann. Exact and fast collision detection. Diploma thesis, Beckman Institute, 1994.  Home/Search   Document Details and Download   Summary   Related Articles

....of these cells. However, there is a little problem: two objects might occupy several cells at the same time. With the nave approach, the same object pair would be handed to the exact collision detection several times in one frame. To prevent this from happening, we need to mark them some how. See [47] for a technique using time stamp. 2.3.5 Distance Based Algorithms A few algorithms use the notion of distance between polyhedra. Clearly, two polyhedra do not intersect each other if their distance is greater than zero. All of the algorithms presented in the literature can handle only convex ....

....better than I COLLIDE. IMPULSE [29] is a collision handling library. It consists of over 27000 lines of C code written by Brian Mirtich. It is based on Lin Canny and Impulse based collision resolution algorithm. Very few parallel implementations are reported in the literature, i.e. Zachmann [47] some results in his thesis. He used ne grain and coarse grain parallelisation. Recently Paulos [37] has parallelised IMPULSE using coarse grain parallelisation. He used split C to parallelise the original serial code. To achieve real time performance in an environment like virtual reality, ....

G. Zachmann. Exact and fast collision detection. Diploma thesis, Beckman Institute, 1994.

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