搜索资源列表
diam_11_17_06_valis
- 实现点集的最小包围盒和直径的多种算法的源代码，包含论文说明。-The minimum bounding box and the diameter of the source code for a variety of algorithms to achieve a set of points, contains papers illustrate.
Havel-Hakimi-Theorem
- 此代码是图论Havel-Hakimi Theorem的实现，用于解决给出点集的入度数，判断一个图是否连通图-This code is shown in Figure On the implementation of the Havel-Hakimi Theorem, for solving the given point set into the degree to determine whether a graph connected graph
trapezoidalmap
- 平面点集的Delaunay三角剖分。为了验证Delaunay三角剖分的正确性，系统提供了“圆测试”的功能，供用户对生成的三角形进行测试验证；为了验证DCEL数据结构的正确性，系统提供了“DCEL测试”的功能，用户输入任意一条测试线，系统将先后显示出测试线贯穿过的三角形；为了形象显示三角剖分的分治过程，系统提供了动态显示分治剖分过程。 -Planar point set Delaunay triangulation. In order to verify the correctness of De
haudroff
- matlab housdroff距离 可用于评价点集之间的相似度-matlab housdroff point set distance can be used to evaluate the degree of similarity between
CPair
- vs2010编写的最接近点对实现代码 实现功能： 1、文件读点（txt），手动描点，且可相互累加 2、坐标的显示，点数据显示 3、求解最接近点对及其距离，并图像表示 4、清空点集 -vs2010 write code to achieve the closest point to the achievement of functions: 1, file read point, manual tracing point, and can accumulate two mu
NodeCover
- 实现点集覆盖，算法设计与分析作业，有图形界面-Achieve point set coverage, algorithm design and analysis work, a graphical interface
icp
- 迭代最近点算法的完整Matlab程序，输入两个点集，输出旋转矩阵、平移向量和整体误差，验证可用。-Complete iterative closest point algorithm Matlab program, enter the two point sets, the output rotation matrix and translation vector and the overall error, verify availability.
Excluding-the-error-screen-error
- 根据中误差剔除平面点集误差，拟合平面参数-Excluding the error screen error
Graham_scanCSharpcode
- c#实现gram凸包算法源码,输入点集，传出凸包点-c#gram code
MinAreaRectangle
- 对平面上的点集，寻找它的最小面积包围矩形，最小周长包围矩形，以及最大距离点对。算法采用了游标卡尺的思想，在找到凸包后时间复杂度为线性。-for finding the minimum area encasing rectangle and the maximum distance pair. The complexity of this algorithmis O(n),so it s very fast.
Opencvtwo-dimensionalpoint
- 利用opencv编写的一段分割二维点集的程序代码-Opencv prepared using two-dimensional point set for some partition of the program code
GA
- 1利用SOMF网络对二维空间中的点集进行分类2自然二进制码、格雷码与十进制码之间的相互转换3GA算法解决最小生成树问题-A two-dimensional space using the SOMF network to classify the set of points in two natural binary, Gray code with decimal code conversion between 3GA algorithm to solve the minimum spanning
point-alignment
- 迭代最近点算法的一个简单实现，并使用了两个二维点集进行测试-an implementation and validation for the data association of two 2d point sets based on iterative closest points
OpenCV
- 基于opencv的use摄像头视频采集程序 1 基于opencv的两个摄像头数据采集 3 能激发你用代码做视频的冲动程序 6 图像反转（就是把黑的变白，白的变黑） 11 图像格式的转换 12 从摄像头或者AVI文件中得到视频流，对视频流进行边缘检测 13 采用Canny算子进行边缘检测 15 角点检测 18 图像的旋转加缩放（效果很拽，用地球做就像谷歌地球似的） 21 Log-Polar极坐标变换 22 对图像进行形态学操作（图像的开闭，腐蚀和膨胀运算）
libicp
- icp算法C++实例，用于点集的配准，实现两片点云数据的拼接-icp algorithm C++ instance, used for the registration point set to achieve splice two pieces of point cloud data
test
- 平面点集 凸包 找最小覆盖矩形面积 平面点集 凸包 找最小覆盖矩形面积-Planar point set to find the smallest rectangle that covers the convex hull of a plane convex hull area to find the smallest rectangular area covering the convex hull of planar point sets to find the smallest cover
chazhiyunihe
- 插值和拟合都是函数逼近或者数值逼近的重要组成部分。他们的共同点都是通过已知一些离散点集M上的约束，求取一个定义在连续集合S的未知连续函数，从而达到获取整体规律目的，即通过"窥几斑"来达到"知全豹"。-Interpolation and fitting function approximation or are an important part of the numerical approximation. They have in common are constrained by the k
cantor
- 一、Cantor三分集的递归算法 选取一个欧氏长度的直线段，将该线段三等分，去掉中间一段，剩下两段。将剩下的两段分别再三等分，各去掉中间一段，剩下四段。将这样的操作继续下去，直到无穷，则可得到一个离散的点集。点数趋于无穷多，而欧氏长度趋于零。经无限操作，达到极限时所得到的离散点集称之为Cantor集。-A recursive algorithm selection Cantor ternary set a Euclidean line segment length, the three eq
knnsearch
- 利用matlab实现就近点邻域寻找算法，获取指定点k邻域范围内的点集-Using matlab realize the neighborhood looking for the nearest point algorithms, access points within a specified point range k neighborhood
datachoice_inpolygon
- 判断特定的点/点集是否在某个区域(boundary)内。调用matlab内置函数inpolygon。boundary可以是一系列(顺序)点的坐标，亦可为矩形[x0,x1,y0,y1].-Check that whether the point(s) is(are) located in the boundary, where boundary can be several points or in form of [x0,x1,y0,y1].