earticle

논문검색

Optimization Algorithm Based on Laplacian Location and Extension Grid

초록

영어

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.

목차

Abstract
 1. Introduction
 2. Evaluation Criterion of Grid Quality
 3. Reconstruction Algorithm of Grid Surface Model
  3.1. Algorithm Procedure
  3.2. Laplacian coordinate of grid vertex
  3.3. Relocation of Grid Vertex
 4. Experiments and Analysis
 5. Conclusion
 Acknowledgment
 References

저자정보

  • Shaohui Ma Department of Computer Science and Technolog, Henan Institute of Technology, Henan Xinxiang 453000, China
  • Xinling Sun Department of Computer Science and Technolog, Henan Institute of Technology, Henan Xinxiang 453000, China
  • Benzhai Hai College of Computer & Information Engineering, Henan Normal University, Xinxiang, Henan, 453007, China
  • Xie Rui-yun College of Computer & Information Engineering, Henan Normal University, Xinxiang, Henan, 453007, China

참고문헌

자료제공 : 네이버학술정보

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.