Exact and efficient construction of Minkowski sums of convex polyhedra with applications

CAD Computer Aided Design

Volumn 39, Issue 11, 2007, Pages 929-940

  Fogel, Efi ^a   Halperin, Dan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

2D arrangement; 3D Minkowski sum; Collision detection; Computational geometry; Gaussian map

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DIGITAL LIBRARIES; LINEAR PROGRAMMING; QUERY PROCESSING;

2D ARRANGEMENT; 3D MINKOWSKI SUM; COLLISION DETECTION; GAUSSIAN MAP;

COMPUTATIONAL GEOMETRY;

EID: 35148839521     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cad.2007.05.017     Document Type: Article

References (43)

1. The Cgal project homepage. http://www.cgal.org/
2. The GNU MP bignum library. http://www.swox.com/gmp/
3. The QuickCD library homepage. http://www.ams.sunysb.edu/~jklosow/quickcd/QuickCD.html
4. The Solid library homepage. http://www.win.tue.nl/cs/tt/gino/solid/
5. The Swift++ library homepage. http://gamma.cs.unc.edu/SWIFT++/
6. The web3D homepage. http://www.web3d.org/
7. Agarwal P.K., Flato E., and Halperin D. Polygon decomposition for efficient construction of Minkowski sums. Computational Geometry: Theory and Applications 21 (2002) 39-61
8. Basch J, Guibas LJ, Ramkumar GD, Ramshaw L. Polyhedral tracings and their convolution. In: Proceedings of 2nd workshop on the algorithmic foundations of robotics. 1996. p. 171-84
9. Bekker H., and Roerdink J.B.T.M. An efficient algorithm to calculate the Minkowski sum of convex 3D polyhedra. Proceedings of international conference on computational science part I (2001), Springer Verlag 619-628
10. Boissonnat J-D, de Lange E, Teillaud M. Minkowski operations for satellite antenna layout. In: Proceedings of 13th annual ACM symposium on computational geometry. 1997. p. 67-76
11. Cameron SA. Enhancing GJK: Computing minimum and penetration distances between convex polyhedra. In: Proceedings of IEEE international conference on robotics and automation. 1997. p. 3112-7
12. Cameron SA, Culley RK. Determining the minimum translational distance between two convex polyhedra. In: Proceedings of IEEE international conference on robotics and automation. 1986. p. 591-6
13. de Berg M., van Kreveld M., Overmars M., and Schwarzkopf O. Computational geometry: Algorithms and applications. 2nd ed. (2000), Springer Verlag, Berlin (Germany)
14. Dobkin D.P., and Kirkpatrick D.G. Determining the separation of preprocessed polyhedra - a unified approach. Proceedings of 17th international colloquium on automata, languages and programming. LNCS vol. 443 (1990), Springer Verlag 400-413
15. Ehmann SA, Lin MC. Accelerated proximity queries between convex polyhedra by multi-level Voronoi marching. In: Proceedings of IEEE conference on intelligent robots and systems. 2000. p. 2101-6
16. Finke U, Hinrichs KH. Overlaying simply connected planar subdivisions in linear time. In: Proceedings of 11th annual ACM symposium on computational geometry. 1995. p. 119-26
17. Fogel E, Halperin D. Video: Exact Minkowski sums of convex polyhedra. In: Proceedings of 21st annual ACM symposium on computational geometry. 2005. p. 382-3
18. Fogel E, Halperin D, Weibel C. On the exact maximum complexity of minkowski sums of convex polyhedra. In: Proceedings of 23rd annual ACM symposium on computational geometry. 2007. p. 319-26
19. Fogel E., Wein R., and Halperin D. Code flexibility and program efficiency by genericity: Improving Cgal's arrangements. Proceedings of 12th annual European symposium on algorithms. LNCS vol. 3221 (2004), Springer Verlag 664-676
20. Fukuda K. From the zonotope construction to the Minkowski addition of convex polytopes. Journal of Symbolic Computation 38 4 (2004) 1261-1272
21. Ghosh P.K. A unified computational framework for Minkowski operations. Computers & Graphics 17 4 (1993) 357-378
22. Gilbert EG, Johnson DW, Keerthi SS. A fast procedure for computing the distance between complex objects. 1988; 4(2):193-203
23. Granados M., Hachenberger P., Hert S., Kettner L., Mehlhorn K., and Seel M. Boolean operations on 3D selective Nef complexes: Data structure, algorithms, and implementation. Proceedings of 11th annual European symposium on algorithms. LNCS vol. 2832 (2003), Springer Verlag 174-186
24. Gritzmann P., and Sturmfels B. Minkowski addition of polytopes: Computational complexity and applications to Gröbner bases. SIAM Journal on Discrete Math 6 2 (1993) 246-269
25. Guibas LJ, Hsu D, Zhang L. H-walk: Hierarchical distance computation for moving convex bodies. In: Proceedings of 15th annual ACM symposium on computational geometry. 1999. p. 265-73
26. Guibas LJ, Ramshaw L, Stolfi J. A kinetic framework for computational geometry. In: Proceedings of 24th annual IEEE symposium on the foundations of computer science. 1983. p. 100-11
27. Guibas L.J., and Seidel R. Computing convolutions by reciprocal search. Discrete & Computational Geometry 2 (1987) 175-193
28. Halperin D., Kavraki L., and Latombe J.-C. Robotics. In: Goodman J.E., and O'Rourke J. (Eds). Handbook of discrete and computational geometry. 2nd ed. (2004), Chapman & Hall/CRC 1065-1093 [chapter 48]
29. Kaul A, Rossignac J. Solid-interpolating deformations: Construction and animation of PIPs. In: Proceedings of European computer graphics conference. 1991. p. 493-505
30. Kettner L. Using generic programming for designing a data structure for polyhedral surfaces. Computational Geometry: Theory and Applications 13 (1999) 65-90
31. Latombe J.-C. Robot motion planning (1991), Kluwer Academic Publishers, Boston
32. Lee I.K., Kim M.S., and Elber G. Polynomial/rational approximation of Minkowski sum boundary curves. Graphical Models and Image Processing 60 2 (1998) 136-165
33. Lin MC, Canny JF. A fast algorithm for incremental distance calculation. In: Proceedings of IEEE international conference on robotics and automation. 1991. p. 1008-14
34. Lin M.C., and Manocha D. Collision and proximity queries. In: Goodman J.E., and O'Rourke J. (Eds). Handbook of discrete and computational geometry. 2nd ed. (2004), Chapman & Hall/CRC 787-807 [chapter 35]
35. Mirtich B. V-clip: Fast and robust polyhedral collision detection. ACM Transactions on Graphics 17 3 (1998) 177-208
36. Pion S, Fabri A. A generic lazy evaluation scheme for exact geometric computations. In: Library-centric software design workshop, part of OOPSLA; 2006
37. Seong J.-K., Kim M.-S., and Sugihara K. The Minkowski sum of two simple surfaces generated by slope-monotone closed curves. Geometric Modeling and Processing - Theory and Applications (2002) 33-42
38. Sharir M. Algorithmic motion planning. In: Goodman J.E., and O'Rourke J. (Eds). Handbook of discrete and computational geometry. 2nd ed. (2004), Chapman & Hall/CRC 1037-1064 [chapter 47]
39. Varadhan G, Manocha D. Accurate Minkowski sum approximation of polyhedral models. In: Proceedings of 12th Pacific conference on computer graphics and applications. IEEE Comput. Sci; 2004. p. 392-401
40. Weibel C. Minkowski sums. http://roso.epfl.ch/cw/poly/public.php
41. Wein R, Fogel E, Zukerman B, Halperin D. Advanced programming techniques applied to Cgal's arrangement package. In: Proceedings of the 1st international workshop on library-centric software design (an OOPSLA workshop). 2005. p. 24-33
42. Wu Y., Shah J.J., and Davidson J.K. Improvements to algorithms for computing the Minkowski sum of 3-polytopes. Computer-Aided Design 35 13 (2003) 1181-1192
43. Yap C.K. Robust geomtric computation. In: Goodman J.E., and O'Rourke J. (Eds). Handbook of discrete and computational geometry. 2nd ed. (2004), Chapman & Hall/CRC 927-952 [chapter 41]