Exact Minkowski sums of polygons with holes

DOI10.1016/j.comgeo.2018.06.005zbMath1402.68183arXiv1502.06195OpenAlexW4210526227MaRDI QIDQ1615780

Michael Hemmer, Efi Fogel, Sebastian Morr, Alon Baram, Dan Halperin

Publication date: 31 October 2018

Published in: Computational Geometry, Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.06195

zbMATH Keywords

arrangementMinkowski sumCGALpolygon-with-holes

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items

2D Minkowski sums

Uses Software

• CGAL
• 2D Arrangement
• 2D Minkowski sums
• 2D triangulations
• AABB

Cites Work

• Unnamed Item
• Unnamed Item
• A measure of non-convexity in the plane and the Minkowski sum
• CGAL Arrangements and their applications. A step-by-step guide
• Exact and efficient construction of Minkowski sums of convex polyhedra with applications
• Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
• A computing strategy for applications involving offsets, sweeps, and Minkowski operations.
• A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection
• Polyhedral Assembly Partitioning with Infinite Translations or The Importance of Being Exact
• Spatial Planning: A Configuration Space Approach
• A MONOTONIC CONVOLUTION FOR MINKOWSKI SUMS
• 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