Two approximate Minkowski sum algorithms
From MaRDI portal
Recommendations
Cites work
- A floating-point technique for extending the available precision
- A MONOTONIC CONVOLUTION FOR MINKOWSKI SUMS
- Iterated snap rounding
- Rotational polygon containment and minimum enclosure using only robust 2D constructions
- Shortest path geometric rounding
- Vertex-rounding a three-dimensional polyhedral subdivision
Cited in
(11)- Optimal clustering of a pair of irregular objects
- Quasi-phi-functions and optimal packing of ellipses
- Planar shape manipulation using approximate geometric primitives
- REDUCING THE TIME COMPLEXITY AND IDENTIFYING ILL-POSED PROBLEM INSTANCES OF MINKOWSKI SUM BASED SIMILARITY CALCULATIONS
- Phi-functions for 2D objects formed by line segments and circular arcs
- Efficient Predicate Evaluation Using Randomized Degeneracy Detection
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- A MONOTONIC CONVOLUTION FOR MINKOWSKI SUMS
- Accurate Minkowski sum approximation of polyhedral models
- Improvements to algorithms for computing the Minkowski sum of 3-polytopes
- A parallel branch-and-bound-and-check algorithm for nesting
This page was built for publication: Two approximate Minkowski sum algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4931734)