Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Agarwal, P.K., Flato, E., Halperin, D.: Polygon decomposition for efficient construction of Minkowski sums. Computational Geometry: Theory and Applications 21, 39–61 (2002)
2. Chazelle, B., Dobkin, D.P.: Optimal convex decompositions. In: Toussaint, G.T. (ed.) Computational Geometry, pp. 63–133. North-Holland, Amsterdam (1985)
3. de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)
4. Flato, E.: 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. Lecture Notes in Computer Science;E. Fogel,2004
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献