Tetrahedralization of Simple and Non-Simple Polyhedra
暂无分享,去创建一个
Godfried T. Toussaint | Binhai Zhu | Clark Verbrugge | Cao An Wang | G. Toussaint | B. Zhu | C. Wang | Clark Verbrugge
[1] Bernard Chazelle. Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..
[2] F. Bagemihl,et al. On Indecomposable Polyhedra , 1948 .
[3] Ron Y. Pinter,et al. Polygon Triangulation: Efficiency and Minimality , 1986, J. Algorithms.
[4] E. Schönhardt,et al. Über die Zerlegung von Dreieckspolyedern in Tetraeder , 1928 .
[5] Raimund Seidel,et al. On the difficulty of triangulating three-dimensional Nonconvex Polyhedra , 1992, Discret. Comput. Geom..
[6] János Pach,et al. Cell decomposition of polytopes by bending , 1988 .
[7] N. J. Lennes. Theorems on the Simple Finite Polygon and Polyhedron , 1911 .
[8] Bernard Chazelle,et al. Triangulating a non-convex polytype , 1989, SCG '89.
[9] Bernard Chazelle,et al. Triangulating a nonconvex polytope , 1990, Discret. Comput. Geom..
[10] Marshall W. Bern,et al. Compatible tetrahedralizations , 1993, SCG '93.
[11] J. O'Rourke. Art gallery theorems and algorithms , 1987 .