On triangulating three-dimensional polygons
暂无分享,去创建一个
[1] David Eppstein,et al. MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .
[2] Ronald C. Read,et al. The knot book: An elementary introduction to the mathematical theory of knots , 1997, Complex..
[3] Bernard Chazelle. Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..
[4] Bernard Chazelle,et al. Triangulating a simple polygon in linear time , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[5] N. J. Lennes. Theorems on the Simple Finite Polygon and Polyhedron , 1911 .
[6] Raimund Seidel,et al. On the difficulty of triangulating three-dimensional Nonconvex Polyhedra , 1992, Discret. Comput. Geom..
[7] H. E. Slaught. THE CARUS MATHEMATICAL MONOGRAPHS , 1923 .
[8] Michael J. Wozny,et al. Automatic CAD-model Repair: Shell-Closure , 1992 .
[9] G. Budworth. The Knot Book , 1983 .
[10] Leonidas J. Guibas,et al. Topologically sweeping an arrangement , 1986, STOC '86.
[11] G. Klincsek. Minimal Triangulations of Polygonal Domains , 1980 .
[12] A. Dolenc,et al. Some Efficient Procedures for Correcting Triangulated Models , 1993 .
[13] Jack Snoeyink,et al. A trivial knot whose spanning disks have exponential size , 1990, SCG '90.
[14] Micha Sharir,et al. Filling gaps in the boundary of a polyhedron , 1995, Comput. Aided Geom. Des..
[15] Horst Schubert,et al. Die eindeutige Zerlegbarkeit eines Knotens in Primknoten , 1949 .
[16] D. Eppstein,et al. MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .
[17] Micha Sharir,et al. Piecewise-Linear Interpolation between Polygonal Slices , 1996, Comput. Vis. Image Underst..