Exact minkowski sums and applications

Authors:
Eyal Flato;Efi Fogel;Dan Halperin;Eran Leiserowitz
Affiliations:
Tel Aviv University;Tel Aviv University;Tel Aviv University;Tel Aviv University
Venue:
Proceedings of the eighteenth annual symposium on Computational geometry
Year:
2002

Citing 4
Cited 1

LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
The design and implementation of panar maps in CGAL

Journal of Experimental Algorithmics (JEA)
Robot Motion Planning

Robot Motion Planning
Polygon decomposition for efficient construction of Minkowski sums

Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)

Erosion based visibility preprocessing

EGRW '03 Proceedings of the 14th Eurographics workshop on Rendering

Quantified Score

Hi-index	0.00

Visualization

Abstract

(MATH) The Minkowski sum of two sets P and Q in $\realsd is the set (p+q \mid p &Egr; P, q &Egr; Q). Minkowski sums are useful in robot motion planning, computer-aided design and manufacturing (CAD/CAM) and many other areas. In this video we present a software package implemented at Tel Aviv University for the exact and efficient construction of Minkowski sums of planar sets. We also explain and demonstrate how Minkowski sums are used in various applications.