Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
DOI10.1007/S00453-008-9219-6zbMATH Open1186.68500OpenAlexW2123424922MaRDI QIDQ834598FDOQ834598
Authors: Peter Hachenberger 
Publication date: 27 August 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9219-6
Recommendations
- Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications
- A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection
- scientific article; zbMATH DE number 1670643
Minkowski sumexact arithmeticdecomposition of polyhedra into convex piecesNef polyhedratight passage
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- GEOMPACK — a software package for the generation of meshes using geometric algorithms
- Strategies for polyhedral surface decomposition: an experimental study.
- Triangulating a nonconvex polytope
- Offsetting operations in solid modelling
- Accurate Minkowski sum approximation of polyhedral models
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Triangles in space or building (and analyzing) castles in the air
- Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
- Improved construction of vertical decompositions of three-dimensional arrangements
- Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
- Polygon decomposition for efficient construction of Minkowski sums
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications
- Convex Decomposition of Polyhedra and Robustness
- Vertical decompositions for triangles in 3-space
- Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
Cited In (14)
- Contributing vertices-based Minkowski sum computation of convex polyhedra
- Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
- Interactive generalized penetration depth computation for rigid and articulated models using object norm
- Table based detection of degenerate predicates in free space construction
- Title not available (Why is that?)
- Motion planning via manifold samples
- Title not available (Why is that?)
- Approximating multidimensional subset sum and Minkowski decomposition of polygons
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications
- Polygon decomposition for efficient construction of Minkowski sums
- Fast Detection of Degenerate Predicates in Free Space Construction
- Exact Minkowski sums of polygons with holes
- Closed-form characterization of the Minkowski sum and difference of two ellipsoids
- Geometrical discretisations for unfitted finite elements on explicit boundary representations
Uses Software
This page was built for publication: Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834598)
