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

Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics

Volumn 2006, Issue , 2006, Pages 3-15

  Fogel, Efi ^a   Halperint, Dan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; DATABASE SYSTEMS; EMBEDDED SYSTEMS; PROXIMITY INDICATORS;

COMPUTATIONAL GEOMETRY ALGORITHM LIBRARARY; CONVEX POLYHEDRA; MINKOWSKI SUMS; OUTPUT SENSITIVE APPROACH;

ALGORITHMS;

EID: 33646845824     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972863.1     Document Type: Conference Paper

References (38)

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 webSD homepage. http://www.web3d.org/.
7. P. K. Agarwal, E. Plato, and D. Halperin. Polygon decomposition for efficient construction of Minkowski sums. Comput. Geom. Theory Appl., 21:39-61, 2002.
8. J. Basch, L. J. Guibas, and G. D. Ramkumar. Reporting red-blue intersections between two sets of connected line segments. In Proc. 4th Annu. Euro. Sympos. Alg., volume 1136 of LNCS, pages 302-319. Springer-Verlag, 1996.
9. H. Bekker and J. B. T. M. Roerdink. An efficient algorithm to calculate the Minkowski sum of convex 3d polyhedra. In Proc. of the Int. Conf. on Comput. Sci.-Part I, pages 619-628. Springer-Verlag, 2001.
10. J.-D. Boissonnat, E. de Lange, and M. Teillaud. Minkowski operations for satellite antenna layout. In Proc. 13th Annu. ACM Sympos. on Comput. Geom., pages 67-76, 1997.
11. S. A. Cameron. Enhancing GJK: computing minimum and penetration distances between convex polyhedra. In Proc. of IEEE Int. Conf. Robot. Auto., pages 3112-3117, Apr. 1997.
12. S. A. Cameron and R. K. Culley. Determining the minimum translational distance between two convex polyhedra. In Proc. of IEEE Int. Conf. Robot. Auto., pages 591-596, 1986.
13. D. P. Dobkin and D. G. Kirkpatrick. Determining the separation of preprocessed polyhedra - a unified approach. In Proc. 17th Int. Colloq. Auto. Lang. Prog., volume 443 of LNCS, pages 400-413. Springer-Verlag, 1990.
14. S. A. Ehmann and M. C. Lin. Accelerated proximity queries between convex polyhedra by multi-level Voronoi marching. In Proc. IEEE/RST Int., Conf. Intell. Robot. Sys., pages 2101-2106, 2000.
15. U. Finke and K. H. Hinrichs. Overlaying simply connected planar subdivisions in linear time. In Proc. 11th Annu. ACM Sympos. on Comput. Geom., pages 119-126. ACM Press, 1995.
16. E. Fogel and D. Halperin. Video: Exact minkowski sums of convex polyhedra. In Proc. ACM Sympos. on Comput. Geom., pages 382-383, 2005.
17. E. Fogel, R. Wein, and D. Halperin. Code flexibility and program efficiency by genericity: Improving CGAL'S arrangements. In Proc. 12th Annu. Euro. Sympos. Alg., volume 3221 of LNCS, pages 664-676. Springer-Verlag, 2004.
18. K. Fukuda, From the zonotope construction to the Minkowski addition of convex polytopes. Journal of Symbolic Computation, 38(4):1261-1272, 2004.
19. P. K. Ghosh. A unified computational framework for Minkowski operations. Comp. Graph., 17(4):357-378, 1993.
20. E. G. Gilbert, D. W. Johnson, and S. S. Keerthi. A fast procedure for computing the distance between complex objects. Proc. of IEEE Int. J. Robot. Auto., 4(2):193-203, 1988.
21. M. Granados, P. Hachenberger, S. Hert, L. Kettner, K. Mehlhorn, and M. Seel. Boolean operations on 3d selective nef complexes: Data structure, algorithms, and implementation. In Proc. 11th Annu. Euro. Sympos. Alg., volume 2832 of LNCS, pages 174-186. Springer-Verlag, 2003.
22. P. Gritzmann and B. Sturmfels. Minkowski addition of polytopes: Computational complexity and applications to Gröbner bases. SIAM J. Disc. Math, 6(2):246-269, 1993.
23. L. Guibas, D. Hsu, and L. Zhang. H-walk: Hierarchical distance computation for moving convex bodies. In ACM Sympos. on Comput. Geom., pages 265-273, 1999.
24. L. J. Guibas, L. Ramshaw, and J. Stolfi. A kinetic framework for computational geometry. In Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci., pages 100-111, 1983.
25. L. J. Guibas and R. Seidel. Computing convolutions by reciprocal search. Disc. Comp. Geom., 2:175-193, 1987.
26. D. Halperin, L. Kavraki, and J.-C. Latombe. Robotics. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, 2nd Edition, chapter 48, pages 1065-1093. CRC, 2004.
27. A. Kaul and J. Rossignac. Solid-interpolation deformations: Construction and animation of PIPs. In Eurographics'91, pages 493-505, 1991.
28. L. Kettner. Using generic programming for designing a data structure for polyhedral surfaces. Comput. Geom. Theory Appl., 13:65-90, 1999.
29. J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991.
30. I. K. Lee, M. S. Kim, and G. Elber. Polynomial/rational approximation of Minkowski sum boundary curves. Graphical Models and Image Processing, 60(2):136-165, 1998.
31. M. C. Lin and J. F. Canny. A fast algorithm for incremental distance calculation. In Proc. of IEEE Int. Conf. Robot. Auto., pages 1008-1014, 1991.
32. M. G. Lin and D. Manocha. Collision and proximity queries. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, 2nd Edition, chapter 35, pages 787-807. CRC, 2004.
33. B. Mirtich. V-clip: Fast and robust polyhedral collision detection. ACM Trans. Graph., 17(3):177-208, 1998.
34. J.-K. Seong, M.-S. Kim, and K. Sugihara. The Minkowski sum of two simple surfaces generated by slope-monotone closed curves. In Geom. Model. Proc.: Theory and Appl., pages 33-42. IEEE Comput. Sci., 2002.
35. M. Sharir. Algorithmic motion planning. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, 2nd Edition, chapter 47, pages 1037-1064. CRC, 2004.
36. G. Varadhan and D. Manocha. Accurate Minkowski sum approximation of polyhedral models. In Proc. Comput. Graph, and Appl., 12th Pacific Conf., on (PG'04), pages 392-401. IEEE Comput. Sci., 2004.
37. C. Weibel. Minkowski sums. http://roso.epfl.ch/cw/poly/public.php.
38. R. Wein, E. Fogel, B. Zukerman, and D. Halperin. Advanced programming techniques applied to cgal's arrangement package. In Library-Centric Software Design Workshop (LCSD'05), 2005. Available online at http://lcsd05.cs.tamu.edu/ #program.