An Improved Refinement Algorithm of Triangular Mesh Subdivision Based on Minimum Weight Theory

Abstract

The triangular mesh subdivision to any planar field has been widely adopted in such applicable fields as configurable engineer, computer graphics, and scientific computation visualization and so on because of its well approach to the borderline. Thus, developing and researching on one certain effective and reliable triangular mesh subdivision algorithm has important theoretical and practical meanings. This paper firstly describes a refined algorithm about triangular mesh based on geometrical multi-grid method, and discusses its advantages and disadvantages. Secondly a new refined algorithm about triangular mesh subdivision is put forward by applying Fermat point and its properties as well as the minimum weight theory of triangular meshed subdivision. Finally, this paper proves that this refined algorithm can actually improve the efficiency of triangular mesh subdivision and generate grids amount and quality.