Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference13 articles.
1. Fogel, E., Halperin, D., Weibel, C.: On the exact maximum complexity of Minkowski sums of polytopes. Discrete Comput. Geom. 42(4), 654–669 (2009)
2. Fukuda, K., Weibel, C.: On f-vectors of Minkowski additions of convex polytopes. Discrete Comput. Geom. 37, 503–516 (2007)
3. Fukuda, K., Weibel, C.: A linear equation for Minkowski sums of polytopes relatively in general position. Eur. J. Comb. 31(2), 565–573 (2010). Combinatorics and geometry
4. Gritzmann, P., Sturmfels, B.: Minkowski addition of polytopes: computational complexity and applications to Gröbner bases. SIAM J. Discrete Math. 6(2), 246–269 (1993)
5. Halperin, D., Kavraki, L.E., Latombe, J.-C.: Robotics. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, Chap. 48, pp. 1065–1093. CRC Press, Boca Raton (2004)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献