Sciweavers

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

34

ESA
2006
Springer

favoriteEmaildiscussreport

189views Algorithms» more ESA 2006»

Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method

14 years 2 months ago

Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method

Download www.cs.tau.ac.il

Ron Wein

Real-time Traffic

Algorithms | ESA 2006 |

claim paper

Related Content

» Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes

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

» Approximate Inference on Planar Graphs using Loop Calculus and Belief Propagation

» A subdivisionbased algorithm for the sparse resultant

» Arrangements on Parametric Surfaces II Concretizations and Applications

» Optimal AnalysisAware Parameterization of Computational Domain in Isogeometric Analysis

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	ESA
Authors	Ron Wein

Comments (0)