Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications

DOI10.1137/1.9781611972863.1zbMath1428.68323OpenAlexW2272980419MaRDI QIDQ5233464

Efi Fogel, Dan Halperin

Publication date: 11 September 2019

Published in: 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/13e29577ce52dd4476b19bf74b2e09a6c4c3ae46

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Advanced programming techniques applied to CGAL's arrangement package ⋮ Covering Minkowski sum boundary using points with applications

Uses Software

• CGAL