Pages that link to "Item:Q2023661"
From MaRDI portal
The following pages link to The distance between convex sets with Minkowski sum structure: application to collision detection (Q2023661):
Displaying 8 items.
- Maximal distance for robotic simulation: The convex case (Q1091953) (← links)
- A maximal distance result of interest in robotic simulation (Q1091955) (← links)
- Minimal distance calculation between the industrial robot and its workspace based on circle/polygon-slices representation (Q2049850) (← links)
- Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets (Q2282820) (← links)
- The GJK distance algorithm: an interval version for incremental motions (Q2387753) (← links)
- A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection (Q3079491) (← links)
- Multivariate Monotone Inclusions in Saddle Form (Q5085132) (← links)
- The geometry of monotone operator splitting methods (Q6598417) (← links)