前n条最短路算法matlab源代码-Toolbox-Fast-Marching-Unix:适用于GNU/Linux的库Toolbox-Fast

上传者: 38695061 | 上传时间: 2022-05-05 20:19:27 | 文件大小: 292KB | 文件类型: ZIP
前n条最短路算法matlab源代码资料来源 这是Mitchell,Mount和Papadimitriou于1987年首次描述的用于三角形网格(三角表面)的测地线(最短路径)算法的实现,[1]进行了一些小的改进,扩展和简化。 该算法具有O(n ^ 2 log n)最坏情况下的时间复杂度,但实际上可以在合理的时间内处理百万个节点的网格。 有关快速概述,请参见[2]。 该算法的基本思想与Dijkstra的用于在加权图上找到最短路径的算法非常相似。 它包括两个步骤: 来自源的距离场在网格表面上的传播(缓慢) 追溯从目标点到最近源的最短路径(快速) 为了进行调试和比较,我还实现了两种近似算法 Dijkstra在图上由网格的顶点和边缘创建的最短路径 细分(在网格的每个边缘上放置N个附加顶点,直接连接属于同一面的所有顶点,在结果图上运行Dijkstra)细分算法的一个不错的特性是,当N = 0时,它变为Dijkstra并计算出精确的距离当N->无穷大时。 输入网格表示为两个数组:顶点(每个顶点具有树坐标)和面(每个面表示为其顶点的索引)。 与算法的大多数通信是通过SurfacePoints(网格表面

文件下载

资源详情

[{"title":"( 41 个子文件 292KB ) 前n条最短路算法matlab源代码-Toolbox-Fast-Marching-Unix:适用于GNU/Linux的库Toolbox-Fast","children":[{"title":"Toolbox-Fast-Marching-Unix-master","children":[{"title":".gitignore <span style='color:#111;'> 18B </span>","children":null,"spread":false},{"title":"geoc","children":[{"title":"geodesic_algorithm_exact.h <span style='color:#111;'> 37.22KB </span>","children":null,"spread":false},{"title":"example1.cpp <span style='color:#111;'> 3.32KB </span>","children":null,"spread":false},{"title":"geodesic_algorithm_base.log <span style='color:#111;'> 39.44KB </span>","children":null,"spread":false},{"title":"geodesic_matlab_api.h <span style='color:#111;'> 1.61KB </span>","children":null,"spread":false},{"title":"hedgehog_mesh.txt <span style='color:#111;'> 16.42KB </span>","children":null,"spread":false},{"title":"geodesic_algorithm_dijkstra_alternative.h <span style='color:#111;'> 8.74KB </span>","children":null,"spread":false},{"title":"geodesic_constants_and_simple_functions.h <span style='color:#111;'> 1.89KB </span>","children":null,"spread":false},{"title":"geodesic_algorithm_base.h <span style='color:#111;'> 5.46KB </span>","children":null,"spread":false},{"title":"geodesic_matlab_api.cpp <span style='color:#111;'> 6.12KB </span>","children":null,"spread":false},{"title":"geodesic_mesh_elements.h <span style='color:#111;'> 8.43KB </span>","children":null,"spread":false},{"title":"geodesic_mesh.h <span style='color:#111;'> 14.03KB </span>","children":null,"spread":false},{"title":"flat_triangular_mesh.txt <span style='color:#111;'> 5.70KB </span>","children":null,"spread":false},{"title":"geodesic_memory.h <span style='color:#111;'> 4.04KB </span>","children":null,"spread":false},{"title":"geodesic_algorithm_subdivision.h <span style='color:#111;'> 7.33KB </span>","children":null,"spread":false},{"title":"geodesic_algorithm_exact_elements.h <span style='color:#111;'> 9.27KB </span>","children":null,"spread":false},{"title":"example0.cpp <span style='color:#111;'> 2.99KB </span>","children":null,"spread":false},{"title":"geodesic_algorithm_graph_base.h <span style='color:#111;'> 8.33KB </span>","children":null,"spread":false},{"title":"readme.txt <span style='color:#111;'> 4.58KB </span>","children":null,"spread":false},{"title":"geodesic_algorithm_dijkstra.h <span style='color:#111;'> 3.80KB </span>","children":null,"spread":false}],"spread":false},{"title":"geodesic_new_algorithm.m <span style='color:#111;'> 722B </span>","children":null,"spread":false},{"title":"geodesic_matlab_api.h <span style='color:#111;'> 1.76KB </span>","children":null,"spread":false},{"title":"extract_coordinates_from_path.m <span style='color:#111;'> 498B </span>","children":null,"spread":false},{"title":"geodesic_trace_back.m <span style='color:#111;'> 465B </span>","children":null,"spread":false},{"title":"license.txt <span style='color:#111;'> 1.28KB </span>","children":null,"spread":false},{"title":"geodesic_propagate.m <span style='color:#111;'> 559B </span>","children":null,"spread":false},{"title":"README.md <span style='color:#111;'> 4.72KB </span>","children":null,"spread":false},{"title":"geodesic_create_surface_point.m <span style='color:#111;'> 212B </span>","children":null,"spread":false},{"title":"create_flat_triangular_mesh.m <span style='color:#111;'> 859B </span>","children":null,"spread":false},{"title":"geodesic_convert_surface_points.m <span style='color:#111;'> 1.21KB </span>","children":null,"spread":false},{"title":"geodesic_delete.m <span style='color:#111;'> 793B </span>","children":null,"spread":false},{"title":"example1.m <span style='color:#111;'> 2.42KB </span>","children":null,"spread":false},{"title":"example5.m <span style='color:#111;'> 4.82KB </span>","children":null,"spread":false},{"title":"example4.m <span style='color:#111;'> 2.58KB </span>","children":null,"spread":false},{"title":"geodesic_new_mesh.m <span style='color:#111;'> 794B </span>","children":null,"spread":false},{"title":"geodesic_distance_and_source.m <span style='color:#111;'> 1011B </span>","children":null,"spread":false},{"title":"create_subdivision_pattern.m <span style='color:#111;'> 999B </span>","children":null,"spread":false},{"title":"example3.m <span style='color:#111;'> 3.37KB </span>","children":null,"spread":false},{"title":"create_hedgehog_mesh.m <span style='color:#111;'> 745B </span>","children":null,"spread":false},{"title":"geodesic_matlab_api.so <span style='color:#111;'> 944.71KB </span>","children":null,"spread":false},{"title":"example2.m <span style='color:#111;'> 3.34KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明