A Method Of Reduce Information On Triangle Mesh Redundant Vertexes

Along with the development of technology and the intenseness of competi tion in manufacturing industry, reverse engineering and rapid prototyping technolo gy which can bring notable profit to products' exploration have emerged as the t imes requiring and developed rapidly. As standard data's input and output modul e of most CAD softwares, STL file formats have been used widely in reverse e ngineering and rapid prototyping system. However, a mass of redundant informati on exist in the STL file formats and may break the topological connection of tri angles. Moreover, a large data amount will also cause discommodiousness to file s' storage and transfer. Based on comprehensive comparisons of current methods for remove of STL file's redundant points, a new method has been proposed in this thesis which was based upon balance tree and B+ tree. Experiments show th at the new way has better effect.Besides, in this thesis, on the simplification of mesh models, Garland's ed ge collapse arithmetic which based on quadratic error matrices has been improve d, the method of adding eigenvalue with weight has been bring forwarded: For e very edge of mesh, the angle between two normal of faces which are adjacent i s calculated, then the greatest one will be selected among them, and the mini he ap is build to pick up eigenvalue, finally simplification was operated on edge co llapse algorithm of adding eigenvalue with weight, which will delete the edges t hat are unimportant to model character representation. The experiments' results sh ow that as a kind of self-acting mesh simplification arithmetic, the arithmetic pro posed in this thesis not only inherit the advantages of Garland's method such as rapid calculating rate and good simplification effect, but also overcome it's disa dvantages including excessively uniform distribution and can not stress models' si gnificant characterizations.