Obstacle collision detection using best ellipsoid fit

DOI10.1023/A:1007960531949MaRDI QIDQ676374zbMATH OpenOpenAlexWikidataFDO

Authors Stephen Boyd, Elon Rimon

Publication date 16 October 1997

Published in Journal of Intelligent \& Robotic Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1007960531949

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Cited in

(11)

• Solving the trust-region subproblem by a generalized eigenvalue problem
• Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. II: Applications to ellipses and ellipsoids
• Simulating hard rigid bodies
• Finding minimum volume circumscribing ellipsoids using generalized copositive programming
• Topological classification of the intersection curves of two quadrics using a set of discriminants
• A procedure for efficient generation and behavioral evaluation of ultra‐packed ellipsoidal particle systems
• An algebraic approach to continuous collision detection for ellipsoids
• Continuous detection of the variations of the intersection curve of two moving quadrics in 3-dimensional projective space
• Using signature sequences to classify intersection curves of two quadrics
• Robust fitting of ellipsoids by separating interior and exterior points during optimization
• A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids

This page was built for publication: Obstacle collision detection using best ellipsoid fit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676374)