Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
From MaRDI portal
Publication:834598
DOI10.1007/s00453-008-9219-6zbMath1186.68500OpenAlexW2123424922MaRDI QIDQ834598
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
Minkowski sumexact arithmeticdecomposition of polyhedra into convex piecesNef polyhedratight passage
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Exact Minkowski sums of polygons with holes, Geometrical discretisations for unfitted finite elements on explicit boundary representations, Interactive generalized penetration depth computation for rigid and articulated models using object norm, Motion planning via manifold samples, Closed-form characterization of the Minkowski sum and difference of two ellipsoids, Fast Detection of Degenerate Predicates in Free Space Construction, Table based detection of degenerate predicates in free space construction
Uses Software
Cites Work
- Exact and efficient construction of Minkowski sums of convex polyhedra with applications
- Triangulating a nonconvex polytope
- Offsetting operations in solid modelling
- Vertical decompositions for triangles in 3-space
- Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
- Strategies for polyhedral surface decomposition: an experimental study.
- Triangles in space or building (and analyzing) castles in the air
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
- Convex Decomposition of Polyhedra and Robustness
- GEOMPACK — a software package for the generation of meshes using geometric algorithms
- Improved construction of vertical decompositions of three-dimensional arrangements
- Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
- Accurate Minkowski sum approximation of polyhedral models
- Polygon decomposition for efficient construction of Minkowski sums
