1. What have the authors contributed in "Practical quad mesh simplification" ?
In this paper the authors present an innovative approach to incremental quad mesh simplification, i. e. the task of producing a low complexity quad mesh starting from a high complexity one.. The authors show how good tessellation quality ( e. g. in terms of vertex valencies ) can be achieved by pursuing uniform length and canonical proportions of edges and diagonals.. The authors also present an original Triangleto-Quad conversion algorithm that behaves well in terms of geometrical complexity and tessellation quality, which they use to obtain the initial quad mesh from a given triangle mesh.
read more
![Table 1: Simplification results on various datasets. The computation times required for simplifying the initial dataset into the coarsest model (on a Intel Core2 2.4Ghz 2.00 GB). For each quad-mesh (input and simplified), we report: vertex valency (max and % of regular vertices); homeometry (min, max and variance of edge or diagonal length, all normalized with ideal length µ); and Hausdorff distance (computed with [CCR08]), with respect to bounding box diagonal. When possible, results from [DSC09] and [BZK09] are reported too (the latter is a quad-remeshing approach).](/figures/table-1-simplification-results-on-various-datasets-the-2fe3ub2h.webp)
