Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications
Minkowski sum of 2 orthogonal dioctagonal pyramids | ||
---|---|---|
![]() |
![]() |
![]() |
Primal | Dual | Dual Unfolded |
Abstract
We present an exact implementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in

Movie
Dan Halperin and Efi Fogel
Video: Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications
In Proceedings of the 21st ACM Symposium on Computational Geometry (SoCG), 382-383, Piza, 2005 [avi 117MB] [link] [bibtex]
Links
- Dan Halperin and Efi Fogel
Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications
Computer Aided Design, 39(11): 929-940, 2007 [link] [bibtex] - Dan Halperin and Efi Fogel
Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications
In Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (Alenex), pages 3-15, Miami, Florida, January 2006 [pdf] [bibtex]
Contact
Efi Fogel | ![]() |
![]() |
Dan Halperin | ![]() |
![]() |