Pages that link to "Item:Q1774572"
From MaRDI portal
The following pages link to Efficient computation of the Hausdorff distance between polytopes by exterior random covering (Q1774572):
Displaying 7 items.
- A robust and efficient method for solving point distance problems by homotopy (Q526832) (← links)
- Uniform tree approximation by global optimization techniques (Q600944) (← links)
- Precise Hausdorff distance computation between polygonal meshes (Q625134) (← links)
- Representation complexity of adaptive 3D distance fields (Q632926) (← links)
- The obstacle avoidance motion planning problem for autonomous vehicles: a low-demanding receding horizon control scheme (Q2344399) (← links)
- Hausdorff matching and Lipschitz optimization (Q2457916) (← links)
- Computational aspects of the Hausdorff distance in unbounded dimension (Q2968119) (← links)