搜索资源列表
shortest1
- 这是一个关于最短路径的算法，用于计算点到点之间的最小距离。-This is a study on the shortest path algorithm, used to calculate the minimum distance between point-to-point.
fast_cpda
- 一种快速的基于在弦到点距离累技术的角点检测- A Fast Corner Detector Based on the Chord-to-Point Distance Accumulation Technique 1. Find the edge image using the Canny edge detector. 2. Extract edges (curves) from the edge image: 2a. fill gaps if they are
ex3-network
- 代码提供了一个矩阵,其中存有点到点的距离,根据输入的起点与终点计算出最短路径-Code provides a matrix into which the distance from point to point, the start and end points of the input calculate the shortest path
Dijkstar和Floyd算法
- 程序分别用Dijkstar和Floyd两种算法来计算最短距离，从文件读取点的信息，文件格式为起点，到点，距离。程序含有有时间函数，可以对两种算法进行比较，能够得出比较好的结果。
deJuLi
- 人体三维数据处理方法，运用点到点的距离，进行精简-Distance the body three-dimensional data processing method, the use of point-to streamline
LineChkPoint
- 点到直线的最短距离的判断 点（x0,y0） 到由两点组成的线段（x1,y1） ,( x2,y2 )(The point of judging the shortest distance from a point to a straight line (x0, Y0) is the line segment (x1, Y1) consisting of two points, (X2, Y2).)