搜索资源列表
fly123diao
- /* To wrap edges seamlessly, copy edge values around to other side of array */ if (i==0) fa[(subSize*size) + j] = fa[(i * size) + j] if (j==0) fa[(i*size) + subSize] = fa[(i * size) + j] j+=stride -/ * To wrap edges seam
tubianli
- 以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-table adjacent to the structure for storage, connectivity to the map without the depth and breadth of priority priority traversal. Users designated as a starting point node, the out
gabor11
- gabor滤波器，可以检测图像边缘信息，有利于初学者使用学习。-gabor filter can detect edges, and is conducive to beginners learning.
edgetools
- SUSAN-based functions to detects image edges and their orientation-SUSAN-based functions to detects image ed celebrated and their orientation
tudeshengdubianli
- 图的深度遍历，用二叉树实现，输入时要遵循二叉树的顶点和边数的对应关系-traverse the depth map, using binary tree realize that the importation of binary tree to be followed when the number of vertices and edges of the relationship
pCed
- 最优的阶梯型边缘（step edge）检测算法---Canny边缘检测方法，边缘检测是提取图像特征的首要条件.一种改进型Canny边缘检测算法-optimal ladder edges (step edge) detection algorithm -- Canny edge detection method , edge detection image feature extraction is the first condition. An improved Canny edge detec
dijkstraautomatique
- dijkstra算法，windows和linux下编译通过，可以从文件读取数据，也可以手动输入边数及点数，自动生成边长。-dijkstra algorithm, windows and linux under compile, can read data from the paper, can also manually input edges and points, automatic generation length.
Bellman_Fordautomatique
- bellmanford算法，windows和linux下编译通过，可以从文件读取数据，也可以手动输入边数及点数，自动生成边长。-bellmanford algorithm, windows and linux under compile, can read data from the paper, can also manually input edges and points, automatic generation length.
fast_distance_map_caculate
- 使用边缘跟踪，种子填充等算法提取图像边界，然后使用并行的方法来计算图像的距离图。-using edge tracking and seed filling algorithm to detect the edges of images, then use the parallel approach to the calculation of the distance between the image map.
S1D13305lcd320240
- 这是我做的针对S1D13305的驱动源码，我集成了ASCII码字库和一级简码汉字库，可以显示任意常用汉字和英文字符，另外还有基本的画线、圆、多边形以及填充等功能！但是由于画图时是边计算边显示，所以显示效果会有抖动，只需通过缓冲区作为中转站就可以解决问题，这个问题就让给使用者解决了！ 如有问题可以发email给我，xianyun.wang@gmail.com-This is what I do against the S1D13305 driver source code, I integra
pulse_Measure1
- 上、下边沿开始测量脉冲脉宽，以及整个脉冲的宽度-upper and lower edges began measuring pulse, and the whole pulse width
SUSAN_Edge_Detection
- This function uses the SUSAN algorithm to find edges within an image-This function uses the algorithm to f SUSAN ind edges within an image
computer3dedges
- 计算给定的一个三维网格模型的边数为多少，并计算出都是那些边。对于我们以后的三维模型的处理上，可用于一个判断的条件，-to calculate the three-dimensional grid a model of the number of edges, and those are calculated edge. After our three-dimensional model of the treatment, a judge can be used to the conditions
EDdetect
- v2.1 (19th October, 2000) - Will only draw the edges adjacent to the real picture if it fits. - Added prototyping detection. See http://www.generation5.org/vision.shtml - Flicker-free drawing. - Wait cursor during long operations, and status
chaincode
- 1.首先将原始图档(如图三)由RGB彩色模型转换成HSI彩色模型，取其 I 亮度模型。 2.再萃取出亮度值大于0.999之部份，进行数次膨胀与侵蚀运算后，即可取得火焰部份(如图四)。 3.图四之火焰影像进行边缘运算，并找出边缘之每一点坐标，再将坐标排序，取最小值作为链码的启始点(如图五之红色星号)。 4.链码产生的方式：沿边缘依逆时针的顺序扫瞄下一个边界值，并依序输出链码(如图七)。-1. First, the original drawing (Figure 3) from R
kthtree
- kthtree问题 给定一棵有向树T，树T 中每个顶点u都有一个权w(u)；树的每条边(u,v)也都有一个 非负边长d(u,v)。有向树T的每个顶点u 可以看作客户，其服务需求量为w(u)。每条边(u,v)的边长d(u,v) 可以看作运输费用。如果在顶点u 处未设置服务机构，则将顶点u 处的服务需求沿有向树的边(u,v)转移到顶点v 处服务机构需付出的服务转移费用为w(u)*d(u,v)。 树根处已设置了服务机构，现在要在树T中增设k处服务机构，使得整棵树T 的服务转移费用最小-kt
gol
- 多边形以n, x_array, y_array形式给出，其中x_array，y_array中存放着多边形的n个顶点的x, y坐标。扫描线填色算法的基本思想是： 用水平扫描线从上到下扫描由点线段构成的多段构成的多边形。每根扫描线与多边形各边产生一系列交点。将这些交点按照x坐标进行分类，将分类后的交点成对取出，作为两个端点，以所填的色彩画水平直线。多边形被扫描完毕后，填色也就完成。 上述基本思想中，有几个问题需要解决或改善-polygon n, x_array, y_arr
Dijkstra_c
- C#中实现最短路，该图算法描述的是这样的场景：图由节点和带有方向的边构成，每条边都有相应的权值，路径规划（最短路径）算法就是要找出从节点A到节点B的累积权值最小的路径。-achieve the most short-circuit, the algorithm described in the plan that is the scene : map with nodes and from the direction of the edges, and each side has a corre
Cannyfenge1
- 图像处理中，往往需要提取的图像的边缘线。本程式代码利用Canny算子，提取灰度图的边缘.-image processing usually requires extraction of image edges. The program code using Canny operator, from the edge of the gray level.
edgedetectionandextraction
- 本程序是图像处理中最基本的程序之一，用来检测和提取物体的边沿,并对其进行轮廓跟踪.是一个小小的应用程序.-the image processing procedure is the most basic one of the procedures used to detect and extract the edges of objects. and its contour tracking. is a small application.