搜索资源列表
qhull-2010.1
- 一个快速实现三维凸包的程序,并且有Delaunay三角化,半平面交,voronoi图。-a 3D quickhull program,and has delaunay triagulation,half intersection,voronoi programs.
FindConvertex
- 计算几何中求散点的凸包,在opengl的环境中开发完成-Scatter in computational geometry convex hull of demand in the developed environment opengl
tubaoliudongjisuan
- 管内含凸包的流动计算,计算在不同Ma数情况下,含凸包矩形内的流动情况-Tube containing the flow of convex hull computation, computing the number of cases in different Ma, convex rectangle with the flow
TIN1.0
- tin 不规则三角网 凸包 生成 tin 不规则三角网 凸包 生成 tin 不规则三角网 凸包 生成 -TIN tin tin convex hull generated convex hull generated TIN TIN tin tin generated convex hull generated triangulated irregular network
tubao
- 一种新的最小凸包算法及其应用,在64*64大小的矩形内,生成任意个(可输入)点的x,y坐标 在最短的时间内计算出包含这些点的凸包-Edges of the edge detection and the points listed
rare
- 求凸包的面积,求能够覆盖这个凸包的最小面积-Find the area of convex hull
convhull
- Matlab编程考试的一道题。随机生成50个点,计算它的一个凸包,并计算凸包的面积-Matlab programming test a question. Randomly generated 50 points, calculate a convex hull, and calculate the area of ??convex hull
tubao
- 凸包算法,根据鼠标点出来的点来画凸多边形。-Convex hull algorithm, according to the mouse point to draw out of the convex polygon.
YALL1-v1.3
- 求解L1范数最小化问题的凸优化工具包,共含有6个模型的求解方法-Solving the L1-norm minimization problem of convex optimization toolkit contains a total of six methods of solving the model
tubao
- 凸包问题的解决方法…………凸包问题的解决方法-tubao problem
ConvexHulls
- 凸包,使用先左右排序再计算上凸包下凸包的方法,效率还可以。-Convex hull, and then calculated using the first order around the convex hull on the package approach, efficiency gains can be.
ConvexHull2D
- 对任意二维多边形,求出其二维凸包函数,用java实现-complex hull
ConvexHull3D
- 对任意多边形,求出其三维凸包,用java实现,来自计算几何c描述-complexhull in 3d
convex-hull
- 点集Q的凸包(convex hull)是指一个最小凸多边形,满足Q中的点或者在多边形边上或者在其内。-Q of the convex point set bag (convex hull) is to point to a minimum convex polygons, meet the Q point or in the polygon the side or in them.
TarsusPmultiplication
- 分治法大整数乘法课件 概述:算法概要、算法效率 合并排序 快速排序 折半查找 大整数乘法 Strassen 矩阵乘法 分治法解凸包 -Divide and conquer integer multiplication courseware about the function and some problems very effective way to solve the that serious .I think it will be ok!
graham
- Graham扫描算法 : 大体思路是将不是凸包顶点的点从点集中去掉。 找出S中具有最小y坐标的点p(通过选取最左边的点打破平局) 根据点和p的连线 与 x轴正方向所成的角度,对S中的点进行排序(由小到大),并将p放在最前面。 从p点开始扫描排序后的S集合。如果这些点都在凸包上,则每三个相继的点p1,p2,p3满足以下性质:p3在向量<p1,p2>的左边.如果出现相继的三个点p1,p2,p3不满足上述性质,则p2点一定不是凸包的顶点,应立即去除。-Grah
Delaunay-triangulation-algorithm
- Delaunay三角网算法的设计与研究对 DTM 的建立有着重要的作用, 本文在分析已有三角网算法的基础上, 根据逐点插入算法的思想与凸包算法相结合, 提出了自己的算法: 先绘制凸包, 然后构建初始三角网, 最后用 LOP方法整体优化。该算法尽可能的减少了对一条边的优化次数, 从而提高了算法的运行效率-The interference of the cloud no ise affects seriously the interpretation and information extracti
CONVEXHULL
- 周培德翻译的《计算几何:算法设计与分析》中的凸包算法,在Visual Studio2008平台用C#语言编写的基于页面的二维凸包生成程序。本人拥有自主版权!-Zhou s translation, "Computational Geometry: algorithm design and analysis" of the convex hull algorithm, written in C# in Visual Studio2008 platform packet generation pa
shiyan
- 将背景与前景从视频中分割开 并将前景进行多边形或凸包处理-Background and foreground separated from the video and The foreground polygon or convex hull
Manli
- 蛮力算法,实现随机点的凸包问题的计算,自动计算出凸点。-Brute force algorithm,realize the random dots convex bags calculation,Automatically calculate the convex point。