On the exact maximum complexity of Minkowski sums of convex polyhedra

DOI10.1145/1247069.1247126MaRDI QIDQ3602890zbMATH OpenOpenAlexFDO

Authors Efi Fogel, Christophe Weibel, Dan Halperin

Publication date 12 February 2009

Published in Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1247069.1247126

Mathematics Subject Classification ID

Minkowski geometries in nonlinear incidence geometry (51B20) Descriptive geometry (51N05) Convex sets in (3) dimensions (including convex surfaces) (52A15) Three-dimensional polytopes (52B10) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

This page was built for publication: On the exact maximum complexity of Minkowski sums of convex polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602890)