Tetrahedralization of Simple and Non-Simple Polyhedra.
作者： Clark Verbrugge , Cao An Wang , Godfried T. Toussaint , Binhai Zhu
DOI:
关键词:
摘要:
参考文章(10)
E. Sch�nhardt, Über die Zerlegung von Dreieckspolyedern in Tetraeder Mathematische Annalen. ,vol. 98, pp. 309- 312 ,(1928) , 10.1007/BF01451597
B. Chazelle, L. Palios, Triangulating a non-convex polytype symposium on computational geometry. ,vol. 5, pp. 393- 400 ,(1989) , 10.1145/73833.73876
Takao Asano, Tetsuo Asano, Ron Y Pinter, Polygon triangulation: efficiency and minimality Journal of Algorithms. ,vol. 7, pp. 221- 231 ,(1986) , 10.1016/0196-6774(86)90005-2
János Pach, Jacob E. Goodman, Cell Decomposition of Polytopes by Bending ,(2017)
Joseph O'Rourke, Art gallery theorems and algorithms ,(1987)
Bernard Chazelle, Triangulating a simple polygon in linear time Discrete & Computational Geometry. ,vol. 6, pp. 485- 524 ,(1991) , 10.1007/BF02574703
Jim Ruppert, Raimund Seidel, On the difficulty of triangulating three-dimensional Nonconvex Polyhedra Discrete & Computational Geometry. ,vol. 7, pp. 227- 253 ,(1992) , 10.1007/BF02187840
F. Bagemihl, On Indecomposable Polyhedra American Mathematical Monthly. ,vol. 55, pp. 411- 413 ,(1948) , 10.1080/00029890.1948.11999266
N. J. Lennes, Theorems on the Simple Finite Polygon and Polyhedron American Journal of Mathematics. ,vol. 33, pp. 37- ,(1911) , 10.2307/2369986
Marshall Bern, Compatible tetrahedralizations Proceedings of the ninth annual symposium on Computational geometry - SCG '93. pp. 281- 288 ,(1993) , 10.1145/160985.161151