Fast Surface Simplification Based on Weighted Rotation of Normal

We present a new surface simplification algorithm. The algorithm is based on iterative edge contracting, and exploits a new method to measure the cost of collapse which takes the length of contracting edge and the rotation of the normal vector to the related triangle into account. In addition, the proposed algorithm adopts the multiple-choice approach to find the simplification sequence, which leads to a significant speedup with reduced memory overhead