搜索资源列表
-
1下载:
各种关于几何的算法实现。包括
计算几何学库函数(线相交,面积等等)
寻找凸包 graham 扫描法
判断点是否在多边形内。同时包含一些测试-on various geometric algorithm. In terms of geometry library functions (lines intersect, size, etc.) for convex hull graham scanning judgment and whether the polygon. Both co
-
-
1下载:
计算几何中,用VC++实现的求点集凸包的包裹算法-computational geometry, with VC point for the collection of parcels convex hull algorithm
-
-
0下载:
计算几何学常用算法库 C++语言实现
代码内容 计算几何学常用算法库,包括以下算法:
确定两条线段是否相交
判断点p是否在线段上
判断点q是否在多边形Polygon内
计算多边形的面积
寻找凸包 graham 扫描法
-geometry calculation commonly used algorithm for C language code as calculated geometry commonly used algorithm li
-
-
2下载:
怒火之袍的贡献,有算法介绍如判断点是否在线段上、判断两线段是否相交、判断线段和直线是否相交、判断点是否在多边形中、判断线段是否在多边形内、计算点到线段的最近点、计算点到圆的最近距离及交点坐标、计算两条共线的线段的交点、求线段或直线与圆的交点、凸包的求法等等,图文并茂-Army's contribution to the gowns, as introduced algorithm to determine the point of whether online, to judge whe
-
-
1下载:
8. 判断点是否在凸多边形内 9. 寻找点集的graham算法 10.寻找点集凸包的卷包裹法 11.判断线段是否在多边形内 12.求简单多边形的重心 13.求凸多边形的重心14.求肯定在给定多边形内的一个点15.求从多边形外一点出发到该多边形的切线16.判断多边形的核是否存在-8. In judging whether a convex polygon 9. Find points of graham algorithm 10. Find point set of convex hull vol
-
-
1下载:
由一堆离散点,自动生成它的最小外包多边形,及凸壳。-By a bunch of discrete points, it is automatically generated out of the smallest polygon, and the Convex Hull.
-
-
0下载:
关于图像最小凸包的一系列算法,该算法主要运用于OpenCV 中的MinAreaBox()函数中 用于确定图像的倾斜角度-With regard to image the smallest convex hull of a series of algorithm, which mainly used OpenCV in MinAreaBox () function is used to determine the image of the tilt angle of
-
-
0下载:
Graham凸包扫描算法,算法速度快,很经典的,程序内部注释比较全面。-Graham scan algorithm for convex hull algorithm is fast, very classic, more comprehensive program within the comment.
-
-
0下载:
其中讲述了计算几何中常用的叉积定义以及应用,凸包算法,还有半平面交算法-Which describes the computational geometry of the cross product definition of commonly used applications, convex hull algorithm, there are half-plane intersection algorithm
-
-
0下载:
matlab convex hull 详细算法(Detailed algorithm for matlab convex hull)
-