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

zbMATH Keywords

Minkowski sumexact arithmeticdecomposition of polyhedra into convex piecesNef polyhedratight passage

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

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

Cites work

• Accurate Minkowski sum approximation of polyhedral models
• Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
• Convex Decomposition of Polyhedra and Robustness
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
• Exact and efficient construction of Minkowski sums of convex polyhedra with applications
• GEOMPACK — a software package for the generation of meshes using geometric algorithms
• Improved construction of vertical decompositions of three-dimensional arrangements
• Offsetting operations in solid modelling
• Polygon decomposition for efficient construction of Minkowski sums
• Strategies for polyhedral surface decomposition: an experimental study.
• Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
• Triangles in space or building (and analyzing) castles in the air
• Triangulating a nonconvex polytope
• Vertical decompositions for triangles in 3-space

Cited in

(13)

• scientific article; zbMATH DE number 5130863 (Why is no real title available?)
• Exact and efficient construction of Minkowski sums of convex polyhedra with applications
• Exact and efficient construction of Minkowski sums of convex polyhedra with applications
• Contributing vertices-based Minkowski sum computation of convex polyhedra
• Approximating multidimensional subset sum and Minkowski decomposition of polygons
• Polygon decomposition for efficient construction of Minkowski sums
• scientific article; zbMATH DE number 1670643 (Why is no real title available?)
• Interactive generalized penetration depth computation for rigid and articulated models using object norm
• Closed-form characterization of the Minkowski sum and difference of two ellipsoids
• Fast detection of degenerate predicates in free space construction
• Geometrical discretisations for unfitted finite elements on explicit boundary representations
• Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
• Table based detection of degenerate predicates in free space construction

Describes a project that uses

Uses Software

• CGAL

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)