| 空间四边形网格曲面上最短路径的图论法求解 |
| |
| 引用本文： | 淡卜绸.空间四边形网格曲面上最短路径的图论法求解[J].宝鸡文理学院学报(自然科学版),2011,31(2):57-60. |
| |
| 作者姓名： | 淡卜绸 |
| |
| 作者单位： | 宝鸡文理学院机电工程系，陕西宝鸡,721016 |
| |
| 基金项目： | 宝鸡文理学院重点项目(ZK09154) |
| |
| 摘 要： | 目的在空间四边形网格曲面上,寻求连结所有网格结点的最短路径。方法运用图论的相关知识,提出应用最短哈密顿路径法,通过建树的方法来连结网格节点以形成路径。结果在划分好的空间曲面网格上实现了最短路径的求解,进而证明了提出方法的可行性和构建算法的正确性。结论该方法可以更有效地解决空间曲面上最短路径的求解问题。
|
| 关 键 词： | 空间四边形网格曲面 图论法 最短路径 |
Solution for the shortest path on the mesh surface of spatial quadrangle based on graph theory |
| |
| DAN Bo-chou.Solution for the shortest path on the mesh surface of spatial quadrangle based on graph theory[J].Journal of Baoji College of Arts and Science(Natural Science Edition),2011,31(2):57-60. |
| |
| Authors: | DAN Bo-chou |
| |
| Institution: | DAN Bo-chou(Dept.Mechanical & Elect.Engn.,Baoji Univ.Arts & Sci.,Baoji 721016,Shaanxi,China) |
| |
| Abstract: | Aim To search the shortest path on the mesh surface of spatial quadrangle. Methods The shortest Hamiltonian path algorithm is proposed on the basis of graph theory,and through constructing structure tree the path is formed in the process of linking grid node. Results The shortest path solution is realized on the spatial mesh surface,furthermore,it is testified that the proposed method is feasible and the algorithm is correct. Conclusion The method can effectively find the shortest path on the spatial surfac... |
| |
| Keywords: | spatial quadrilateral mesh surface graph theory the shortest path |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
