Multiresolution Surface Modeling Based on Hierarchical Triangulation

Soucy, Marc‐André; Laurendeau, Denis

doi:10.1006/cviu.1996.0001

Cited by 100 publications

(42 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Their method iteratively selects a vertex for removal, removes all adjacent faces, and retriangulates the resulting hole. Soucy and Laurendeau [10] described a more sophisticated, but essentially similar algorithm. While they provide reasonable efficiency and quality, these methods are not really suited for our purpose.…”

Section: Surface Simplificationmentioning

confidence: 99%

Surface simplification using quadric error metrics

Garland

Heckbert

1997

Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH '97

2,708

2,071

View full text Add to dashboard Cite

Many applications in computer graphics require complex, highly detailed models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models.We have developed a surface simplification algorithm which can rapidly produce high quality approximations of polygonal models. The algorithm uses iterative contractions of vertex pairs to simplify models and maintains surface error approximations using quadric matrices. By contracting arbitrary vertex pairs (not just edges), our algorithm is able to join unconnected regions of models. This can facilitate much better approximations, both visually and with respect to geometric error. In order to allow topological joining, our system also supports non-manifold surface models.

show abstract

Section: Surface Simplificationmentioning

confidence: 99%

Surface simplification using quadric error metrics

Garland

Heckbert

1997

Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH '97

2,708

2,071

View full text Add to dashboard Cite

show abstract

“…Mesh-based simplification methods (Schroeder et al, 1992;Hoppe et al, 1993;Rossignac and Borrel, 1993;Soucy and Laurendeau, 1996;Hoppe, 1996;Garland and Heckbert, 1997;Gao et al, 2010;Xiao et al, 2013), which are the most popular, simplify a CAD model, which is represented by a triangular mesh, by decimating triangles. Triangles are reduced by removing or collapsing edges or vertices.…”

Section: Related Workmentioning

confidence: 99%

CAD model simplification using feature simplifications

Yoon

Kim²

2016

JAMDSM

View full text Add to dashboard Cite

“…A number of algorithms have been published, which simplify models using topological operations such as vertex decimation [6], [18], [19], vertex clustering [14], [17], iterative edge contraction [5], [8], [10], [11], [20], [22] and face constriction [2], [21]. Edge contraction is the most common operator.…”

Section: Related Workmentioning

confidence: 99%