Appendix F: Convex Decomposition of 3D Polyhedra
-
Published:2013
Issue:
Volume:
Page:341-349
-
ISSN:2195-2817
-
Container-title:Simulation Foundations, Methods and Applications
-
language:
-
Short-container-title:
Author:
Coutinho Murilo G.
Publisher
Springer London
Reference7 articles.
1. Bajaj, C.L., Dey, T.K.: Convex decomposition of polyhedra and robustness. SIAM J. Comput. 21(2), 339–364 (1992)
2. Chazelle, B.: Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm. SIAM J. Comput. 13(3), 488–507 (1984)
3. Joe, B.: Delaunay triangular meshes in convex polygons. SIAM J. Sci. Stat. Comput. 7, 514–539 (1986)
4. Joe, B.: Delaunay versus max–min solid angle triangulations for three-dimensional mesh generation. Int. J. Numer. Methods Eng. 31, 987–997 (1991)
5. Joe, B.: Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions. Int. J. Numer. Methods Eng. 37, 693–713 (1994)