Efficient collision detection for moving ellipsoids using separating planes
From MaRDI portal
An algorithm for detecting collision among ellipsoids is described and analyzed. It is based on an algebraic condition on the separation of the ellipsoids and a separating plane. The algorithm is easy to be implemented. It is more accurate than the algorithm to which is compared, since it is not based on polyhedral approximations like the later one.
Recommendations
- Efficient collision detection for moving ellipsoids using separating planes
- An algebraic approach to continuous collision detection for ellipsoids
- Effective algorithm for detection of a collision between spherical particles
- On the interference problem for ellipsoids: experiments and applications
- On the collision detection problem of two moving objects described by algebraic sets
Cited in
(5)- Classification of the relative positions between a small ellipsoid and an elliptic paraboloid
- Efficient collision detection for moving ellipsoids using separating planes
- An algebraic approach to continuous collision detection for ellipsoids
- Efficient collision detection among moving spheres with unknown trajectories
- The quickest transfer of a multidimensional dynamic object onto the surface of an ellipsoid
This page was built for publication: Efficient collision detection for moving ellipsoids using separating planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1885224)