期刊名称:International Journal of Grid and Distributed Computing
印刷版ISSN:2005-4262
出版年度:2016
卷号:9
期号:9
页码:59-66
DOI:10.14257/ijgdc.2016.9.9.06
出版社:SERSC
摘要:This article put forward an optimization algorithm of triangle grid model based on Laplacian coordinate constraint and a fast reconstruction algorithm of model topology structure based on STL file, such methods may enhance the quality of triangular patch as well as splendidly remain local geometric features of original grid model. The character of it is there’s unnecessary to distinguish constraint vertex and free vertex no longer and to carry on a double restraints to location and Laplacian coordinate for all vertex, then solve a linear system, which contains double restraint, with least-squares sense to carry on an relocation for all vertex. The experimental results showed that proposed algorithm is provided with a certain advantage in terms of detail features of grid compared with precedent Laplacian optimization algorithm.
关键词:Triangular grid model; Discrete differential geometry; Surface; Global optimization