Pages that link to "Item:Q735495"
From MaRDI portal
The following pages link to Efficient distance computation in configuration space (Q735495):
Displaying 11 items.
- Generalized penetration depth computation based on kinematical geometry (Q625197) (← links)
- Representation complexity of adaptive 3D distance fields (Q632926) (← links)
- Cost of sequential connection for points in space (Q1122502) (← links)
- Fast spatial decomposition and closest pair computation for limited precision input (Q1587778) (← links)
- The Boolean map distance: theory and efficient computation (Q1690418) (← links)
- Space-Efficient Approximation Scheme for Circular Earth Mover Distance (Q2894457) (← links)
- (Q3185187) (← links)
- Distance bound for nonconvex polyhedral models in close proximity (Q3636365) (← links)
- Computation of penetration between smooth convex objects in three-dimensional space (Q4348622) (← links)
- An efficient algorithm for computing free distance (Corresp.) (Q5641068) (← links)
- Comments on "An efficient algorithm for computing free distance" by Bahl, L., et al. (Q5678749) (← links)