Generalized unstructured decimation [computer graphics]
暂无分享,去创建一个
[1] Carlo H. Séquin,et al. Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments , 1993, SIGGRAPH.
[2] Leila De Floriani,et al. Multiresolution modeling and visualization of volume data based on simplicial complexes , 1994, VVS '94.
[3] Tony DeRose,et al. Mesh optimization , 1993, SIGGRAPH.
[4] Dinesh Manocha,et al. Simplification envelopes , 1996, SIGGRAPH.
[5] Bernd Hamann,et al. A data reduction scheme for triangulated surfaces , 1994, Comput. Aided Geom. Des..
[6] Bernard Chazelle,et al. Triangulating a non-convex polytype , 1989, SCG '89.
[7] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[8] Greg Turk,et al. Re-tiling polygonal surfaces , 1992, SIGGRAPH.
[9] D. F. Watson. Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..
[10] T. J. Barth,et al. On unstructured grids and solvers , 1990 .
[11] Kevin Joseph Renze. Unstructured surface and volume decimation of tessellated domains , 1995 .
[12] William E. Lorensen,et al. Decimation of triangle meshes , 1992, SIGGRAPH.
[13] Raimund Seidel,et al. On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra , 1989, SCG '89.
[14] David Eppstein,et al. MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .
[15] Michael Margaliot,et al. Approximation of Smooth Surfaces and Adaptive Sampling by Piecewise-linear Interpolants , 1995, Computer Graphics.