J. Erikson, L. J. Guibas, J. Stolfi, and L. Zhang, Separationsensitive collision detection for convex objects, in Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA), 1999, pp. 327--336.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... constant time in coherent environments, collision and separation distance queries KINETIC DATA STRUCTURES Recently a new class of algorithms using kinetic data structures (or KDS for short) have been proposed for collision detection between moving convex polygons and polyhedra [BEG 99, EGSZ99, KSS02] cf. Chapter 50) These algorithms are based on the formal framework of KDS to keep track of closest features of polytopes during their motion and exploits motion coherence and geometric locality. The performance of KDS based algorithms is separation sensitive, and may depend on the ....

J. Erickson, L. Guibas, J. Stolfi, and L. Zhang. Separation sensitive collision detection for convex objects. Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pages 327-- 336, 1999.

....robustly in 3D, however. Good theoretical and practical approaches based on the linear complexity of the linear programming problem are known [18, 23] Minkowski difference and convex optimization techniques are used in [9] to compute the distance between convex polyhedra. Erickson, et al. [7] recently proposed a new class of kinetic data structures for collision detection between convex polyhedra. This class of hierarchical representations has only been analyzed for the 2D case however. In applications involving rigid motion, geometric coherence has been exploited to design ....

J. Erikson, L. Guibas, J. Stolfi, and L. Zhang. Separation-sensitive collision detection for convex objects. Proc. of SODA, 1999.

.... there is no need to compute their state again. Some schemes modify the global time step [40, 45, 60] using predictions based on the current simulation state (such as velocities and object separations) but they do not modify the integration time step for individual pairs. Erickson et al.[26] also describe a predictive method, but only for a single pair of objects. Kim et al. 50] describe an event driven algorithm for the simulation of ballistic spheres. In their asynchronous algorithm, collision times for all potential collisions are placed in an event queue. As the head of the ....

....how the objects move with respect to each other influences the cost of collision detection; the shape of the objects and their configuration influences prediction schemes; the global configuration determines the cost of broad phase collision detection; and so on. Recent work by Erickson et al. [26] has provided the beginnings of a theoretical basis, by examining the complexity of collision detection as a function of the algebraic complexity of the objects trajectories, yet this says nothing about the effects of the global configuration, nor is it clear that their algorithm, while open to ....

Jeff Erickson, Leonidas J Guibas, Jorge Stolfi, and Li Zhang. Separation-sensitive collision detection for convex objects. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 327--336, 1999.

....a two layered hierarchical representation of convex chains. This permits us to de ne an adaptive hierarchical outer approximation for simple polygons. The latter can be exploited to give separation sensitive complexity bounds for kinetic collision detection comparable to those of Erickson et al. [1] but in a substantially richer setting (collections of simple polygons as opposed to pairs of convex polygons) 1 Introduction Several kinetic data structures have been introduced for maintaining a certi cate of separation (equivalently detecting collisions) for collections of polygonal objects ....

J. Erickson, L. Guibas, J. Stol, and L. Zhang. Separationsensitive collision detection for convex objects. In Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pages 327-336, 1999.

....robustly in 3D, however. Good theoretical and practical approaches based on the linear complexity of the linear programming problem are known [18, 23] Minkowski difference and convex optimization techniques are used in [10] to compute the distance between convex polyhedra. Erickson, et al. [7] recently proposed a new class of kinetic data structures for collision detection between convex polyhedra. This class of hierarchical representations has only been analyzed for the 2D case however. In applications involving rigid motion, geometric coherence has been exploited to design ....

J. Erikson, L. Guibas, J. Stolfi, and L. Zhang. Separation-sensitive collision detection for convex objects. Proc. of SODA, 1999.

....robustly in 3D, however. Good theoretical and practical approaches based on the linear complexity of the linear programming problem are known [18, 23] Minkowski difference and convex optimization techniques are used in [10] to compute the distance between convex polyhedra. Erickson, et al. [7] recently proposed a new class of kinetic data structures for collision detection between convex polyhedra. This class of hierarchical representations has only been analyzed for the 2D case however. In applications involving rigid motion, geometric coherence has been exploited to design ....

J. Erikson, L. Guibas, J. Stolfi, and L. Zhang. Separation-sensitive collision detection for convex objects. Proc. of SODA, 1999.

No context found.

J. Erikson, L. J. Guibas, J. Stolfi, and L. Zhang, Separationsensitive collision detection for convex objects, in Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA), 1999, pp. 327--336.

No context found.

J. Erickson, L.J. Guibas, J.Stolfi, L.Zhang. Separation-sensitive Collision Detection for Convex Objects. SODA99.

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