Obstacle collision detection using best ellipsoid fit
From MaRDI portal
Publication:676374
DOI10.1023/A:1007960531949zbMath1067.68775OpenAlexW2107454656MaRDI QIDQ676374
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)
Related Items (11)
Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming ⋮ A procedure for efficient generation and behavioral evaluation of ultra‐packed ellipsoidal particle systems ⋮ A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids ⋮ Using signature sequences to classify intersection curves of two quadrics ⋮ Topological classification of the intersection curves of two quadrics using a set of discriminants ⋮ Robust fitting of ellipsoids by separating interior and exterior points during optimization ⋮ Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem ⋮ Continuous detection of the variations of the intersection curve of two moving quadrics in 3-dimensional projective space ⋮ Simulating hard rigid bodies ⋮ An algebraic approach to continuous collision detection for ellipsoids ⋮ Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. II: Applications to ellipses and ellipsoids
This page was built for publication: Obstacle collision detection using best ellipsoid fit
