A Direct Minimization Approach for Obtaining the Distance between Convex Polyhedra
Data up to Jan 2025
Total Citations Per Year
Abstract
References (20)
Lecture Notes in Computer Science 1205
1999 • 38,790 citations
Optimization by Vector Space Methods
1970 • 6,346 citations
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
1986 • 1,537 citations
A fast procedure for computing the distance between complex objects in three-dimensional space
1988 • 1,350 citations
The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
1960 • 1,172 citations
Optimization Methods for Engineering Design
1972 • 615 citations
Distance functions and their application to robot path planning in the presence of obstacles
1985 • 368 citations
Optimal robot plant planning using the minimum-time criterion
1988 • 262 citations
A linear algorithm for determining the separation of convex polyhedra
1985 • 224 citations
Strategies for Solving Collision-free Trajectories Problems for Mobile and Manipulator Robots
1984 • 140 citations
On fast computation of distance between line segments
1985 • 116 citations
An Overview of Analytic Solid Modeling
1985 • 77 citations
Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
1983 • 75 citations
An introduction to linear programming and game theory
1979 • 72 citations
Finding the minimum distance between two convex polygons
1981 • 66 citations
The PADL-1.0/2 system for defining and displaying solid objects
1978 • 55 citations
The PADL-1.0/2 system for defining and displaying solid objects
1978 • 47 citations
Minimum distances for robot task simulation
1983 • 25 citations
Distances between boxes: Applications to collision detection and clipping
1986 • 23 citations
Minimum distances for robot task simulation
1983 • 19 citations