Accurate Minkowski sum approximation of polyhedral models
From MaRDI portal
Recommendations
- A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection
- Two approximate Minkowski sum algorithms
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications
- Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
Cited in
(12)- On soft predicates in subdivision motion planning
- Exact recursive polyhedral description of the feasible parameter set for bounded-error models
- REDUCING THE TIME COMPLEXITY AND IDENTIFYING ILL-POSED PROBLEM INSTANCES OF MINKOWSKI SUM BASED SIMILARITY CALCULATIONS
- Non-commutative morphology: Shapes, filters, and convolutions
- Two approximate Minkowski sum algorithms
- Approximate convex intersection detection with applications to width and Minkowski sums
- On topological integer additive set-labeling of star graphs
- Some indecomposable polyhedra
- A new contact detection method for arbitrary dilated polyhedra with potential function in discrete element method
- Thirty years of developments in contact modelling of non-spherical particles in DEM: a selective review
- Covering Minkowski sum boundary using points with applications
- Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
This page was built for publication: Accurate Minkowski sum approximation of polyhedral models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5491325)