On the exact maximum complexity of Minkowski sums of convex polyhedra

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2007, Pages 319-326

  Fogel, Efi ^a   Halperin, Dan ^a   Weibel, Christophe ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b EPFL   (Switzerland)

Author keywords

Complexity; Convex; Minkowski sum; Polyhedra

Indexed keywords

MATHEMATICAL MODELS; NUMBER THEORY; NUMERICAL METHODS; THEOREM PROVING;

MINKOWSKI SUM; POLYHEDRA;

COMPUTATIONAL COMPLEXITY;

EID: 35348861803     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247069.1247126     Document Type: Conference Paper

References (18)

1. P. K. Agarwal, E. Flato, and D. Halperin. Polygon decomposition for efficient construction of Minkowski sums. Comput. Geom. Theory Appl., 21:39-61, 2002.
2. J. Basch, L. J. Guibas, G. D. Ramkumar, and L. Ramshaw. Polyhedral tracings and their convolution. In Proc. 2nd Workshop Alg. Found. Robot., 1996.
3. 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.
4. 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.
5. 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.
6. E. Fogel and D. Halperin. Exact and efficient construction of Minkowski sums of convex polyhedra with applications. In Proc. 8th Workshop Alg. Eng. Exper. (Alenex'06), 2006.
7. K. Fukuda. From the zonotope construction to the Minkowski addition of convex polytopes. Journal of Symbolic Computation, 38(4):1261-1272, 2004.
8. K. Fukuda and C. Weibel. On f-vectors of Minkowski additions of convex polytopes. Discrete and Computational Geometry. To appear.
9. P. K. Ghosh. A unified computational framework for Minkowski operations. Comp. Graph., 17(4):357-378, 1993.
10. 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.
11. 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.
12. 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.
13. 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.
14. C. D. Hodgson, I. Rivin, and W. D. Smith. A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere. Bull. (New Series) of the AMS, 27:246-251, 1992.
15. A. Kaul and J. Rossignac. Solid-interpolation deformations: Construction and animation of PIPs. In Eurographics'91, pages 493-505, 1991.
16. M. C. 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.
17. 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.
18. C. Weibel. Minkowski sums. http://roso.epf1.ch/cw/poly/public.php.