Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. O’Rourke, J., Supowit, K.J.: Some NP-hard polygon decomposition problems. IEEE Trans. on Information Theory 29, 181–190 (1983)
2. Chazelle, B.: Convex decompositions of polyhedra. In: Proc. of the 13th Annual ACM Symp. on Theory of Computing, pp. 70–79 (1981)
3. Bajaj, C.L., Dey, T.K.: Convex Decomposition of polyhedra and robustness. SIAM Journal on Computing 21(2), 339–364 (1992)
4. Hershberger, J.E., Snoeyink, J.S.: Erased arrangementsof lines and convex decompositions of polyhedra. Computational Geometry: Theory and Applications 9(3), 129–143 (1998)
5. Lien, J., Amato, N.M.: Approximate convex decomposition. Technical Report, TR03-001, Parasol Lab., Texas A&M University (2003)