Pages that link to "Item:Q3079491"
From MaRDI portal
The following pages link to A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection (Q3079491):
Displaying 10 items.
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications (Q628176) (← links)
- Covering Minkowski sum boundary using points with applications (Q735518) (← links)
- Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces (Q834598) (← links)
- Exact Minkowski sums of polygons with holes (Q1615780) (← links)
- Motion planning via manifold samples (Q2017878) (← links)
- The distance between convex sets with Minkowski sum structure: application to collision detection (Q2023661) (← links)
- Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets (Q2282820) (← links)
- Extracting maximal objects from three-dimensional solid materials (Q2668729) (← links)
- Interactive generalized penetration depth computation for rigid and articulated models using object norm (Q5419153) (← links)
- Accurate Minkowski sum approximation of polyhedral models (Q5491325) (← links)
