Polygon decomposition for efficient construction of Minkowski sums

Computational Geometry: Theory and Applications

Volumn 21, Issue 1-2, 2002, Pages 39-61

  Agarwal, Pankaj K ^a   Flato, Eyal ^b   Halperin, Dan ^b  

^a Duke University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Convex decomposition; Experimental results; Minkowski sum; Polygon decomposition

Indexed keywords

EID: 31244436999     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00041-4     Document Type: Article

References (34)

1. P.K. Agarwal, M. Sharir, Arrangements, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, Elsevier Science/North-Holland, Amsterdam, 1999, pp. 49-119.
2. B. Aronov, S. Fortune, Approximating minimum-weight triangulations in three dimensions, Discrete Comput. Geom. 21 (4) (1999) 527-549.
3. C. Bajaj, M.-S. Kirn, Generation of configuration space obstacles: the case of moving algebraic curves, Algorithmica4 (1989) 155-172.
4. M. Bern, Triangulations, in: I.E. Goodman, J. O'Rourke (Eds.), Handbook of Discrete and Computational Geometry, CRC Press, Boca Raton, FL, 1997, pp. 413-428.
5. B. Chazelle, D.P. Dobkin, Optimal convex decompositions, in: G.T. Toussaint (Ed.), Computational Geometry, North-Holland, Amsterdam, 1985, pp. 63-133.
6. K. Daniels, V. Milenkovic, Limited gaps, in: Proc. 6th Canad. Conf. Comput. Geom., 1994, pp. 225-230.
7. M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications, Springer, Berlin, 1997.
8. G. Elber, M.-S. Kirn, Offsets, Sweeps and Minkowski Sums, Special Issue of Comput. Aided Design 31 (1999).
9. D. Eppstein, Approximating the minimum weight Steiner triangulation, Discrete Comput. Geom. 11 (1994) 163-191.
10. A. Fabri, G. Giezeman, L. Kettner, S. Schirra, S. Schonherr, On the design of CGAL, the Computational Geometry Algorithms Library, Software - Practice Exper. 30 (2000) 1167-1202.
11. E. Flato, Robust and efficient construction of planar Minkowski sums, Master's thesis, Department of Computer Science, Tel-Aviv University, http://www.cs.tau.ac.il/~flato, 2000.
12. E. Flato, D. Halperin, Robust and efficient construction of planar Minkowski sums, in: Abstracts 16th European Workshop Comput. Geom., Eilat, 2000, pp. 85-88.
13. E. Flato, D. Halperin, I. Hanniel, O. Nechushtan, The design and implementation of planar maps in CGAL, in: J. Vitter, C. Zaroliagis (Eds.), Proceedings of the 3rd Workshop on Algorithm Engineering, Lecture Notes in Computer Science, Vol. 1148, Springer, 1999, pp. 154-168. To appear in The ACM Journal of Experimental Algorithmics.
14. D. Halperin, Arrangements, in: I.E. Goodman, J. O'Rourke (Eds.), Handbook of Discrete and Computational Geometry, CRC Press, Boca Raton, FL, 1997, pp. 389-412.
15. D. Halperin, J.-C. Latombe, R.H. Wilson, A general framework for assembly planning: The motion space approach, Algorithmica 26 (2000) 577-601.
16. I. Hanniel, The design and implementation of planar arrangements of curves in CGAL, Master's thesis, Department of Computer Science, Tel-Aviv University, 2000.
17. G. Kant, H.L. Bodlaender, Triangulating planar graphs while minimizing the maximum degree, in: Proc. 3rd Scand. Workshop Algorithm Theory, Lecture Notes in Computer Science, Vol. 621, Springer, 1992, pp. 258-271.
18. A. Kaul, R. Farouki, Computing Minkowski sums of plane curves, Internat. J. Comput. Geom. Appl. 5 (1995) 413-432.
19. A. Kaul, M.A. O'Connor, V. Srinivasan, Computing Minkowski sums of regular polygons, in: Proc. 3rd Canad. Conf. Comput. Geom., 1991, pp. 74-77.
20. K. Kedem, R. Livne, J. Pach, M. Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discrete Comput. Geom. 1 (1986) 59-71.
21. J.M. Keil, Decomposing a polygon into simpler components, SIAM J. Comput. 14 (1985) 799-817.
22. J.M. Keil, J.-R. Sack, Minimum decompositions of polygonal objects, in: G.T. Toussaint (Ed.), Computational Geometry, North-Holland, Amsterdam, 1985, pp. 197-216.
23. J.M. Keil, J. Snoeyink, On the time bound for convex decomposition of simple polygons, in: Proc. 1 Oth Canad. Conf. Comput. Geom., 1998.
24. M. Keil, Polygon decomposition, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, Elsevier Science/North-Holland, Amsterdam, 1999.
25. J.-C. Latombe, Robot Motion Planning, Kluwer Academic Publishers, Boston, 1991.
26. I.-K. Lee, M.-S. Kim, G. Eiber, Polynomial/rational approximation of Minkowski sum boundary curves, Graphical Models Image Process. 60 (2) (1998) 136-165.
27. D. Leven, M. Sharir, Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams, Discrete Comput. Geom. 2 (1987) 9-31.
28. K. Melhorn, S. Naher, The LEDA Platform of Combinatorial and Geometric Computing, Cambridge University Press, 1999.
29. K. Mehlhorn, S. Naher, C. Uhrig, M. Seel, The LEDA User Manual, Version 4.0, Max-Planck-Institut für Informatik, 66123 Saarbrucken, Germany, http://www.mpi-sb.mpg.de/LEDA/leda.html, 1999.
30. V. Milenkovic, K. Daniels, Z. Li, Placement and compaction of nonconvex polygons for clothing manufacture, in: Proc. 4th Canad. Conf. Comput. Geom., 1992, pp. 236-243.
31. K. Mulmuley, Computational Geometry: An Introduction through Randomized Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1994.
32. L. Santalo, Integral Probability and Geometric Probability, Encyclopedia of Mathematics and Its Applications, Vol. 1, Addison-Wesley, Reading, MA, 1979.
33. M. Sharir, P.K. Agarvval, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
34. The CGAL User Manual, Version 2.0, http://www.cgal.org, 1999.