Exact Minkowski sums of convex polyhedra - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Efi Fogel, Dan Halperin. Exact Minkowski sums of convex polyhedra. In Joseph S. B. Mitchell, Günter Rote, editors, Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005. pages 382-383, ACM, 2005. [doi]

The following publications are possibly variants of this publication:

On the exact maximum complexity of Minkowski sums of convex polyhedraEfi Fogel, Dan Halperin, Christophe Weibel. compgeom 2007: 319-326 [doi]

Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with ApplicationsEfi Fogel, Dan Halperin. alenex 2006: 3-15 [doi]

Exact and efficient construction of Minkowski sums of convex polyhedra with applicationsEfi Fogel, Dan Halperin. cad, 39(11):929-940, 2007. [doi]

Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-spaceNaama Mayer, Efi Fogel, Dan Halperin. sma 2010: 1-10 [doi]

Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-spaceNaama Mayer, Efi Fogel, Dan Halperin. cad, 43(10):1258-1269, 2011. [doi]

Exact minkowski sums and applicationsEyal Flato, Efi Fogel, Dan Halperin, Eran Leiserowitz. compgeom 2002: 273-274 [doi]

Exact Minkowski Sums of Polygons With HolesAlon Baram, Efi Fogel, Dan Halperin, Michael Hemmer, Sebastian Morr. esa 2015: 71-82 [doi]

runs on WebDSL