년 - 년
Optimization Algorithm Based on Laplacian Location and Extension Grid SCOPUS
보안공학연구지원센터(IJGDC) International Journal of Grid and Distributed Computing Vol.9 No.9 2016.09 pp.59-66
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
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.
0개의 논문이 장바구니에 담겼습니다.
선택하신 파일을 압축중입니다.
잠시만 기다려 주십시오.