Abstract: In dynamic realtime display o f computer graphics, it is the critical focus for the automat ic simplificat ion ofhig hly dense po lygonal sur face models to be approx imate as accur ately as possible by fewer poly gons. Sever al techniques for t he simplificatio n have been developed in recent years. Aimed at the ex istent problems, to take the geometrical approx imation error br ought for th by vertex clustering into consideration and start from pr ogressiv e meshes,some diverse measurement methods ar e unified to t he quadric-based measurement method o f an approx imation er rormodel by means of w eig ht facto rs. An improved quadric-based polygonal sur face simplification algor ithm is put forw ar d. Practical examples have shown it is faster and produces higher quality approximatio ns. It also fits dy namicmultiresolution in r ealtime render 3D engine.

Key words: vertex clustering, quadric error, meshes optimization, progressive meshes, multiresolution