Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces

DOI10.1007/978-3-540-75520-3_59zbMath1151.68704OpenAlexW4231121233MaRDI QIDQ3527256

Peter Hachenberger

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/57d39848-8e55-47a9-9fc0-a103f420db7d

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Covering Minkowski sum boundary using points with applications ⋮ Decompositions and boundary coverings of non-convex fat polyhedra

Uses Software

• CGAL

This page was built for publication: Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces