A vertex algorithm for collision detection

DOI10.1016/S0377-2217(98)00370-1MaRDI QIDQ1579473zbMATH OpenOpenAlexFDO

Authors Mohammad Dikko S. Aliyu

Publication date 14 September 2000

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(98)00370-1

zbMATH Keywords

convex hullminimum distancenonlinear programmingpolytopesimulation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90) Automated systems (robots, etc.) in control theory (93C85)

Recommendations

• LP-Based Algorithms for Detecting the Collision of Moving Objects
• Collision of convex objects
• Fast collision detection in four-dimensional space
• scientific article; zbMATH DE number 1839668
• On the collision detection problem of two moving objects described by algebraic sets

Cites work

• A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
• Distance estimation and collision prediction for on-line robotic motion planning
• Exterior point algorithms for nearest points and convex quadratic programs
• Fast collision detection in four-dimensional space
• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• LP-Based Algorithms for Detecting the Collision of Moving Objects
• On using LP to collision detection between a manipulator arm and surrounding obstacles

Cited in

(24)

• Reliable collision detection for time-dependent parametric surfaces
• Fast collision detection in four-dimensional space
• Collision detection algorithm of a continuous type using spherical extreme vertex diagrams
• On using LP to collision detection between a manipulator arm and surrounding obstacles
• Collision computation of moving bodies
• Some properties of touching distances for polygons and polyhedra
• A neural network measuring the intersection of m-dimensional convex polyhedra
• The distance between convex sets with Minkowski sum structure: application to collision detection
• A robust segment/triangle intersection algorithm for interference tests. Efficiency study
• Guaranteed collision detection with toleranced motions
• On the collision detection problem of two moving objects described by algebraic sets
• Parallel collision detection between moving robots for practical motion planning
• An improved algorithm on minimum distance splitting between the NURBS surfaces
• scientific article; zbMATH DE number 4074554 (Why is no real title available?)
• Predictions about collision free paths from intersection tests
• scientific article; zbMATH DE number 1280933 (Why is no real title available?)
• Collision ditection for contact problems in mechanics with a boundary search algorithm
• scientific article; zbMATH DE number 1487774 (Why is no real title available?)
• Collision Detection Using Interpolation Schemes
• scientific article; zbMATH DE number 1839668 (Why is no real title available?)
• LP-Based Algorithms for Detecting the Collision of Moving Objects
• A collision detection approach for maximizing the material utilization
• Collision of convex objects
• Convex hull representations of models for computing collisions between multiple bodies

Describes a project that uses

Uses Software

• Optimization Toolbox
• Matlab

This page was built for publication: A vertex algorithm for collision detection

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