搜索资源列表
geometry_algorithm
- 各种关于几何的算法实现。包括 计算几何学库函数（线相交，面积等等） 寻找凸包 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
CircleGiftWrap
- 计算几何中，用VC++实现的求点集凸包的包裹算法-computational geometry, with VC point for the collection of parcels convex hull algorithm
geometry_c++
- 计算几何学常用算法库 C++语言实现 代码内容 计算几何学常用算法库，包括以下算法： 确定两条线段是否相交 判断点p是否在线段上 判断点q是否在多边形Polygon内 计算多边形的面积 寻找凸包 graham 扫描法 -geometry calculation commonly used algorithm for C language code as calculated geometry commonly used algorithm li
cagd_arithmetic
- 怒火之袍的贡献，有算法介绍如判断点是否在线段上、判断两线段是否相交、判断线段和直线是否相交、判断点是否在多边形中、判断线段是否在多边形内、计算点到线段的最近点、计算点到圆的最近距离及交点坐标、计算两条共线的线段的交点、求线段或直线与圆的交点、凸包的求法等等，图文并茂-Army's contribution to the gowns, as introduced algorithm to determine the point of whether online, to judge whe
graphicDemo
- 一个简单的图形演示系统,包括多边形的填充,多点插值 (逼近) 的Hermite曲线、Bezier曲线及B样条曲线平面中的凸壳算法-a simple graphic display systems, including polygon filling, Multi-point interpolation (approximate) Hermite curve, Bezier curves and B-spline curves of convex hull algorithms, etc.
contexhull
- TUKE.txe文件中有200个离散点的坐标值,本程序实现生成这些点的凸壳.-TUKE.txe document is 200 discrete points of the coordinate value, The program generating these points of the convex hull.
ImageDespeckle
- 这个是图像去噪算法的实现， hull算法和维纳滤波，
mypolygon2
- 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
minboundrect
- 基于凸壳边界的最小外接矩形拟合MATLAB程序。-Convex hull boundary based on the minimum bounding rectangle fitting MATLAB.
Ccode2.tar
- c语言计算几何 三角化 Ch1, Code 1.14 凸形外壳[2D] Ch3, Code 3.8 凸形外壳[3D] Ch4, Code 4.8 球 Chapter 4, Fig. 4.15 德劳内类型 Ch5, Code 5.2 ...See *English version.-\Computational Geometry in C\ the book s recipe Triangulate Chapter 1, Code 1.14 /tri Convex
DosImageN
- 包括单区域外边界跟踪、跨缝隙穿毛刺轮廓跟踪、边界平滑与规范化、生成区域凸包过程、微分图像二值化-Outside the region including the single-track border, cross-slot wear burr contour tracking, boundary smoothing and standardization, the process of generating the convex hull area, differential image bi
Convex_Hull_Algorithm
- 由一堆离散点，自动生成它的最小外包多边形，及凸壳。-By a bunch of discrete points, it is automatically generated out of the smallest polygon, and the Convex Hull.
Hull
- 利用OPENCV编写的图像HU不变矩，是图像处理的入门的工具-OPENCV prepared to use the image HU invariant moments, is a tool for image processing entry
convex
- 关于图像最小凸包的一系列算法,该算法主要运用于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
Morphological
- Here we use mathematical morphology as a tool to extract useful forms and structures and shapes such as boundaries, skeletons, convex hull. Dilation and Erosion
GrahamScan
- Graham凸包扫描算法，算法速度快，很经典的，程序内部注释比较全面。-Graham scan algorithm for convex hull algorithm is fast, very classic, more comprehensive program within the comment.
CONVEX-HULL
- Convex hull finding of a polygon
find-hull
- 寻找一个不规则图形的外边界点,保存到数组中来-find hull of the gui aaa aa a a a a aa
Convex-hull-test-base
- 凸包最常用的凸包算法是Graham扫描法和Jarvis步进法-The most common convex hull convex hull algorithms Graham Jarvis stepping and scanning method
未命名文件夹
- matlab convex hull 详细算法(Detailed algorithm for matlab convex hull)