On triangulating three-dimensional polygons
暂无分享,去创建一个
[1] Horst Schubert,et al. Die eindeutige Zerlegbarkeit eines Knotens in Primknoten , 1949 .
[2] Michael J. Wozny,et al. Automatic CAD-model Repair: Shell-Closure , 1992 .
[3] D. Du,et al. Computing in Euclidean Geometry , 1995 .
[4] A. Dolenc,et al. Some Efficient Procedures for Correcting Triangulated Models , 1993 .
[5] Prosenjit Bose,et al. Drawing Nice Projections of Objects in Space , 1995, Graph Drawing.
[6] C. Adams. Tales of Topology. (Book Reviews: The Knot Book. An Elementary Introduction to the Mathematical Theory of Knots.) , 1994 .
[7] Micha Sharir,et al. Filling gaps in the boundary of a polyhedron , 1995, Comput. Aided Geom. Des..
[8] Leonidas J. Guibas,et al. Topologically sweeping an arrangement , 1986, STOC '86.
[9] Jack Snoeyink,et al. A trivial knot whose spanning disks have exponential size , 1990, SCG '90.
[10] Micha Sharir,et al. Piecewise-Linear Interpolation between Polygonal Slices , 1996, Comput. Vis. Image Underst..
[11] N. J. Lennes. Theorems on the Simple Finite Polygon and Polyhedron , 1911 .
[12] Bernard Chazelle. Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..
[13] David Eppstein,et al. MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .
[14] Raimund Seidel,et al. On the difficulty of triangulating three-dimensional Nonconvex Polyhedra , 1992, Discret. Comput. Geom..
[15] H. E. Slaught. THE CARUS MATHEMATICAL MONOGRAPHS , 1923 .
[16] Prosenjit Bose,et al. Drawing Nice Projections of Objects in Space , 1999, J. Vis. Commun. Image Represent..