Zu dieser Karteikarte gibt es einen kompletten Satz an Karteikarten. Kostenlos!

In Mesh Decimation, given an input mesh, we try to find another mesh which looks similar but consists of fewer vertices. We would like to bound the approximation error of the decimated mesh. Also, we want to be able to prescribe a target complexity by giving the desired amount of vertices.

Algorithm	Approximation Error	Target Complexity
Vertex Clustering	yes
Incremental Decimation	yes	yes
Remeshing		yes