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

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 effect...

Full description

Saved in:
Bibliographic Details
Published inApplied Mechanics and Materials Vol. 513-517; no. Applied Science, Materials Science and Information Technologies in Industry; pp. 2552 - 2555
Main Author Liu, Huai Hui
Format Journal Article
LanguageEnglish
Published Zurich Trans Tech Publications Ltd 06.02.2014
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary: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.
Bibliography:Selected, peer reviewed papers from the 2014 International Conference on Advances in Materials Science and Information Technologies in Industry (AMSITI 2014), January 11-12, 2014, Xi’an, China
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISBN:9783038350125
3038350125
ISSN:1660-9336
1662-7482
1662-7482
DOI:10.4028/www.scientific.net/AMM.513-517.2552