Pages that link to "Item:Q1971077"
From MaRDI portal
The following pages link to An accurate distance-calculation algorithm for convex polyhedra (Q1971077):
Displaying 17 items.
- A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure (Q411447) (← links)
- Efficient distance computation in configuration space (Q735495) (← links)
- Verified convex hull and distance computation for octree-encoded objects (Q861901) (← links)
- An optimal algorithm for solving collision distance between convex polygons in plane (Q1312900) (← links)
- A hierarchical method for real-time distance computation among moving convex bodies (Q1974624) (← links)
- The gradient and the Hessian of the distance between point and triangle in 3D (Q2287494) (← links)
- The GJK distance algorithm: an interval version for incremental motions (Q2387753) (← links)
- Modelling geometric objects and tolerances with intervals: Data exchange with ISO standard STEP (Q2503172) (← links)
- An Accurate Distance Algorithm for Octree-Encoded Objects (Q2954878) (← links)
- On the Application of Accurate Distance Algorithms to Multibody Simulations (Q3177055) (← links)
- Distance bound for nonconvex polyhedral models in close proximity (Q3636365) (← links)
- (Q3706430) (← links)
- (Q4949363) (← links)
- OPTIMIZATION OF THE ALGORITHM FOR DETERMINING THE HAUSDORFF DISTANCE FOR CONVEX POLYGONS (Q5125208) (← links)
- Numerical Software with Result Verification (Q5308349) (← links)
- (Q5314313) (← links)
- Computing distance using internal axis-aligned bounding-box for nearly intersected objects (Q6051783) (← links)