Exact and efficient construction of planar minkowski sums using the convolution method

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4168 LNCS, Issue , 2006, Pages 829-840

  Wein, Ron ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY VALUE PROBLEMS; COMPUTATION THEORY; COMPUTER SCIENCE; CONVOLUTION; ROBUSTNESS (CONTROL SYSTEMS);

PLANAR MINKOWSKI SUMS; POLYGON BOUNDARIES; POLYGONS; ROBUST IMPLEMENTATION;

SET THEORY;

EID: 33750715105     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_73     Document Type: Conference Paper

References (16)

1. P. K. Agarwal, E. Flato, and D. Halperin. Polygon decomposition for efficient construction of Minkowski sums. Computational Geometry: Theory and Applications, 21:39-61, 2002.
2. B. Chazelle and D. P. Dobkin. Optimal convex decompositions. In G. T. Toussaint, editor, Computational Geometry, pages 63-133. North-Holland, Amsterdam, The Netherlands, 1985.
3. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition, 2000.
4. E. Flato. Robust and efficient construction of planar Minkowski sums. Master's thesis, School of Computer Science, Tel-Aviv University, 2000. http://www.cs.tau.ac.il/CGAL/Theses/flato/thesis/.
5. E. Fogel, R. Wein, and D. Halperin. Code flexibility and program efficiency by genericity: Improving CGAL'S arrangements. In Proc. 12th Europ. Sympos. Alg., volume 3221 of LNCS, pages 664-676, 2004.
6. D. H. Greene. The decomposition of polygons into convex parts. In F. P. Preparata, editor, Computational Geometry, volume 1 of Adv. Comput. Res., pages 235-259. JAI Press, Greenwich, Conn., 1983.
7. L. J. Guibas, L. Ramshaw, and J. Stolfi. A kinetic framework for computational geometry. In Proc. 24th Sympos. Found. Comput. Sci., pages 100-111, 1983.
8. L. J. Guibas and R. Seidel. Computing convolutions by reciprocal search. Discrete and Computational Geometry, 2:175-193, 1987.
9. S. Har-Peled, T. M. Chan, B. Aronov, D. Halperin, and J. Snoeyink. The complexity of a single face of a Minkowski sum. In Proc. 7th Canad. Conf. Comput. Geom., pages 91-96, 1995.
10. S. Hertel and K. Mehlhorn. Fast triangulation of simple polygons. In Proc. 4th Internat. Conf. Found. Comput. Theory, volume 158 of LNCS, pages 207-218. Springer-Verlag, 1983.
11. A. Kaul, M. A. O'Connor, and V. Srinivasan. Computing Minkowski sums of regular polygons. In Proc. 3rd Canad. Conf. Comput. Geom., pages 74-77, 1991.
12. K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete and Computational Geometry, 1:59-71, 1986.
13. K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing, Cambridge University Press, Cambridge, UK, 2000.
14. T. Needham. Visual Complex Analysis. Oxford University Press, Oxford, UK, 1997.
15. G. D. Ramkumar. An algorithm to compute the Minkowski sum outer-face of two simple polygons. In Proc. 12th Sympos. Comput. Geom., pages 234-241, 1996.
16. R. Wein, E. Fogel, B. Zukerman, and D. Halperin. Advanced programming techniques applied to CGAL'S arrangement package. In Proc. Wrkshp. Library-Centric Software Design, 2005. http://lcsd05.cs.tamu.edu/#program.