Model simplification using vertex-clustering

Low, Kok-Lim; Tan, Tony

doi:10.1145/253284.253310

Cited by 142 publications

(65 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figures 2b-d show several simplifications of the dragon model. We here compare our vertex positioning scheme based on quadrics against 1) using the mean of a cluster's vertices and 2) the vertex grading scheme of Rossignac and Borrel that chooses the most important vertex, and which has been improved using the technique in [9]. Fine details near the jaws, neck, and hind leg are washed out by the vertex averaging scheme, and the ridge along the back has lost its sharpness.…”

Section: Resultsmentioning

confidence: 99%

“…Recognizing that Rossignac and Borrel's method is sensitive to translation of the underlying grid, Low and Tan devised a method that uses "floating cells" constructed by sorting the vertices on their importance, and then iteratively letting the most important vertex be the center of a new cluster that absorbs all vertices within an arbitrarily shaped cell volume [9]. While providing higher quality results, one drawback of this approach is that it requires sorting the vertices, which is generally an O(n log n) procedure, compared to the O(n) running time for Rossignac and Borrel's original scheme.…”

Section: Previous Workmentioning

confidence: 99%

See 1 more Smart Citation

Out-of-core simplification of large polygonal models

Lindström

2000

Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH '00

230

164

View full text Add to dashboard Cite

We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme of Rossignac and Borrel [13] by using error quadric information for the placement of each cluster's representative vertex, which better preserves fine details and results in a low mean geometric error. The use of quadrics instead of the vertex grading approach in [13] has the additional benefits of requiring less disk space and only a single pass over the model rather than two. The resulting linear time algorithm allows simplification of datasets of arbitrary complexity.In order to handle degenerate quadrics associated with (near) flat regions and regions with zero Gaussian curvature, we present a robust method for solving the corresponding underconstrained leastsquares problem. The algorithm is able to detect these degeneracies and handle them gracefully. Key features of the simplification method include a bounded Hausdorff error, low mean geometric error, high simplification speed (up to 100,000 triangles/second reduction), output (but not input) sensitive memory requirements, no disk space overhead, and a running time that is independent of the order in which vertices and triangles occur in the mesh.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Previous Workmentioning

confidence: 99%

Out-of-core simplification of large polygonal models

Lindström

2000

Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH '00

230

164

View full text Add to dashboard Cite

show abstract

“…There are now extensive papers on the approximation of dense polygonal meshes by coarser meshes that preserve surface detail. These methods can be roughly divided into five categories: vertex decimation [1,4,33], vertex clustering [24,29], region merging [8,19,27], subdivision meshes [6,13,23,21], and iterative edge contraction [2,3,9,10,11,12,15,16,17,18,28,32]. A complete review of the methods has been given in [7,25].…”

Section: Related Workmentioning

confidence: 99%

Deforming Surface Simplification Based on Feature Preservation

Zhang

2007

Entertainment Computing – ICEC 2007

View full text Add to dashboard Cite

Abstract. In computer graphics, methods for mesh simplification are common. However, most of them focus on static meshes, only few works have been proposed for simplifying deforming surfaces. In this paper, we propose a new method for the multiresolution representation of time-varying meshes based on deformation area and feature preservation. Our method uses the famous QEM (quadric error metric) as our basic metric. The idea is to modify the edge collapse cost by adding the deformation and sharp feature weight to the aggregated quadrics errors when computing the unified edge contraction sequence, then adjust this sequence slightly for each frame to get a minimum geometry distortion. Our approach is fast, easy to implement, and as a result good quality dynamic approximations with well-preserved fine details can be generated at any given frame.

show abstract

“…The work in [12] shows how linear ordering of triangles can be used not only for efficient interactive rendering, but also for mesh simplification and compression. Using cones of normals for a cluster of geometric primitives is common to several papers, like [25,23], which uses them for mesh simplification through vertex clustering.…”

Section: Related Workmentioning

confidence: 99%

Single-strips for fast interactive rendering

et al. 2006

View full text Add to dashboard Cite

Representing a triangulated two manifold using a single triangle strip is an NP-complete problem. By introducing a few Steiner vertices, recent works find such a single-strip, and hence a linear ordering of edge-connected triangles of the entire triangulation. In this paper, we extend previous results [10] that exploit this linear ordering in efficient triangle-strip management for high-performance rendering. We present new algorithms to generate single-strip representations that follow different user defined constraints or preferences in the form of edge weights. These functional constraints are application dependent; For example, normalbased constraints can be used for efficient rendering after visibility culling, or spatial constraints for highly coherent vertex-caching. We highlight the flexibility of this approach by generating single-strips with preferences as arbitrary as the orientation of the edges. We also present a hierarchical single-strip management strategy for high-performance interactive 3D rendering.

show abstract

Model simplification using vertex-clustering

Cited by 142 publications

References 13 publications

Out-of-core simplification of large polygonal models

Out-of-core simplification of large polygonal models

Deforming Surface Simplification Based on Feature Preservation

Single-strips for fast interactive rendering

Contact Info

Product

Resources

About