Eyal Flato
ABSTRACT
(MATH) The Minkowski sum of two sets P and Q in $\realsd is the set (p+q \mid p Ε P, q Ε 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.
- P. K. Agarwal, E. Flato, and D. Halperin. Polygon decomposition for efficient construction of Minkowski sums. Comput. Geom. Theory Appl., 21:39--61, 2002.]] Google Scholar
Digital Library
- G. Elber and M.-S. Kim, editors. Special Issue of Computer Aided Design: Offsets, Sweeps and Minkowski Sums, volume 31. 1999.]]Google Scholar
- E. Flato. Robust and efficient construction of planar Minkowski sums. Master's thesis, Dept. Comput. Sci., Tel-Aviv Univ., 2000. http://www.cs.tau.ac.il/~flato.]]Google Scholar
- E. Flato, D. Halperin, I. Hanniel, O. Nechushtan, and E. Ezra. The design and implementation of planar maps in CGAL. The ACM Journal of Experimental Algorithmics, 5, 2000. Also in LNCS Vol. 1668 (WAE '99), Springer, pp. 154--168.]] Google ScholarDigital Library
- D. Halperin. Robust geometric computing in motion. In B. Donald, K. Lynch, and D. Rus, editors, Algorithmic and Computational Robotics: New Dimensions (WAFR '00), pages 9--22. A. K. Peters, Wellesley, MA, 2001. To appear in International Journal of Robotics Research.]]Google Scholar
- D. Halperin, J.-C. Latombe, and R. H. Wilson. A general framework for assembly planning: The motion space approach. Algorithmica, 26:577--601, 2000.]]Google ScholarCross Ref
- I. Hanniel and D. Halperin. Two-dimensional arrangements in CGAL and adaptive point location for parametric curves. In Proc. of the 4th Workshop of Algorithm Engineering, volume 1982 of Lecture Notes Comput. Sci., pages 171--182. Springer-Verlag, 2000.]] Google ScholarDigital Library
- J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991.]] Google ScholarDigital Library
- K. Melhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.]] Google ScholarDigital Library
Index Terms
- Exact minkowski sums and applications
Recommendations
Maximal f-Vectors of Minkowski Sums of Large Numbers of Polytopes
It is known that in the Minkowski sum of r polytopes in dimension d, with r
In this paper, we study sums of polytopes and prove a linear relation between the number of faces of a sum of r polytopes in dimension d, with rźd, and the number of faces in ...
Topological obstructions for vertex numbers of Minkowski sums
We show that for polytopes P"1,P"2,...,P"r@?R^d, each having n"i>=d+1 vertices, the Minkowski sum P"1+P"2+...+P"r cannot achieve the maximum of @?"in"i vertices if r>=d. This complements a recent result of Fukuda and Weibel (2006), who show that this is ...
Exact and efficient construction of Minkowski sums of convex polyhedra with applications
We present an exact implementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R^3. Our implementation is complete in the sense that it does not assume general position. Namely, it can handle degenerate input, and it ...
Comments