Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

COMPGEOM
2007
ACM

favoriteEmaildiscussreport

86views Discrete Geometry» more COMPGEOM 2007»

On the exact maximum complexity of Minkowski sums of convex polyhedra

13 years 8 months ago

On the exact maximum complexity of Minkowski sums of convex polyhedra

Download www.cs.tau.ac.il

Efi Fogel, Dan Halperin, Christophe Weibel

Real-time Traffic

COMPGEOM 2007 | Discrete Geometry |

claim paper

Related Content

» Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3space

» Exact Minkowski sums of convex polyhedra

» PointBased Minkowski Sum Boundary

» Algorithms for twobox covering

» Deconstructing approximate offsets

Post Info
More Details (n/a)

Added	14 Aug 2010
Updated	14 Aug 2010
Type	Conference
Year	2007
Where	COMPGEOM
Authors	Efi Fogel, Dan Halperin, Christophe Weibel

Comments (0)