Fast mesh simplification via edge collapsing This project contains an implementation of a "multiple choice" mesh simplfication algorithm. Over a number of iterations a random fraction of the total edges in the supplied mesh are processed with a subset of these processed edges collapsed (the lowest scoring collapses win when a collision occurs). The only non-standard dependency is the qef_simd.h single file header which you can find in my "qef" project, a version is also included here.

基于二次边界 collapse 网格简化方法的quadric。 它使用阈值来确定哪些三角形到 delete，从而避免了排序，但可以能导致质量更低。 它的速度大约是Meshlab的4x