Pages that link to "Item:Q5006721"
From MaRDI portal
The following pages link to Iterative algorithms for minimizing the Hausdorff distance between convex polyhedrons (Q5006721):
Displaying 5 items.
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (Q1591950) (← links)
- The distance between convex sets with Minkowski sum structure: application to collision detection (Q2023661) (← links)
- (Q4949363) (← links)
- OPTIMIZATION OF THE ALGORITHM FOR DETERMINING THE HAUSDORFF DISTANCE FOR CONVEX POLYGONS (Q5125208) (← links)
- (Q5314313) (← links)