Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Agarwal, P.K., Flato, E., Halperin, D.: Polygon decomposition for efficient construction of Minkowski sums. Comp. Geom.: Theory and Appl. 21, 39–61 (2002)
2. Aronov, B., Sharir, M.: Triangles in space or building (and analyzing) castles in the air. In: SCG 1988. Proceedings of the fourth annual symposium on Computational geometry, pp. 381–391. ACM Press, New York, USA (1988)
3. Berberich, E., Fogel, E., Halperin, D., Wein, R.: Sweeping over curves and maintaining two-dimensional arrangements on surfaces. In: Proc. 23rd Workshop on Computational Geometry (EWCG 2007), pp. 223–226 (2007)
4. Chazelle, B.: Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm. SIAM Journal on Computing 13(3), 488–507 (1984)
5. Chazelle, B., Dobkin, D., Shouraboura, N., Tal, A.: Strategies for polyhedral surface decomposition: an experimental study. Comput. Geom. Theory Appl. 7(5-6), 327–342 (1997)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献