J. Cohen, A. Varshney, D. Manocha, G. Turk, H. Weber, P. Agarwal, F. Brooks, and W. Wright. Simplification envelopes. ACM Computer Graphics, 30(Proc.ofSIGGRAPH'96):119--128, 1996.  Home/Search   Document Not in Database   Summary   Related Articles

....mesh. Contraction algorithms collapse edges, faces or cells of a mesh to vertices, thereby eliminating a number of cells at a single operation. These algorithms are discussed in the next section. 2. 4 Related Work Most of the research on mesh simplification has been concentrated on surface meshes [4, 7, 11, 14, 15], with relatively few of the methods having also been extended to simplification of volumetric data. In this section, we present a brief outline of some of the basic simplification methods. One of the earliest work on vertex clustering algorithms was proposed by Rossignac and Borrel [18] In ....

....meshes are poor. In [7] it is pointed out that clustering methods can be generalized to use an adaptive grid structure such as an octree [15] to improve quality. Vertex decimation methods, which are based on iterative removal of vertices of a mesh, have been used mostly on triangulated surfaces [4, 14, 19]. In the basic method of Schroeder et al. 19] a vertex is chosen for removal, all the edges connected to the chosen vertex are deleted, and the resulting hole is then re triangulated (Figure 2.2) Due to the re triangulation process the method is restricted to manifold surfaces only . ....

[Article contains additional citation context not shown here]

J. Cohen, A. Varshney, D. Manocha, G. Turk, H. Weber, P. Agarwal, F. Brooks, and W. Wright. Simplification envelopes. ACM Computer Graphics, 30(Proc.ofSIGGRAPH'96):119--128, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC