搜索资源列表
Polygon
- 多边形求并 还有凸包算法,填充颜色和求面积等-Polygons and there are convex hull algorithms, fill color, and for the area, etc.
convex
- 程序实现图像分块,凸包,分割等功能,学图像处理的朋友建议下载。-Image sub-block implementation procedures, convex hull, partition and other functions, the study image processing Friend recommended download.
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.
ConvexHull
- 随机生成一些点,然后利用这些点生成凸包。-Randomly generated at some point, and then use these points to generate the convex hull.
GrahamFCH
- 本代码主要实现土包问题的算法,采用Graham扫描算法,随机生成指定数量的点,求解其凸包。代码中包含注释-The code of the main problems of soil packet algorithm, using Graham scan algorithm to randomly generate a specified number of points, solving its convex hull. Code contains annotations
Algorithm-templates
- 算法模板,包括叉乘,多边形面积,凸包问题,线段相交等-Algorithm templates, including cross multiplication, polygon area, convex hull problem, line segment intersection, etc.
mali
- 蛮力法的程序实现源代码,可以实质性的解决凸包问题,有运行界面--Convex hull problem ~ mfc based on the implementation. Rough interface, the implementation of the major functions of ~
ConvexHull
- 使用C++实现的基于OpenGl的Graham扫描法求解二维凸包问题-Using c++ implementation based on OpenGl Graham scan method to solve the two dimensional convex hull problem
voronoi
- Voronoi Diagram算法实现主要运用分治法和凸包的方法来实现。 分治法: 1) 该问题的规模缩小到一定的程度就可以容易地解决 2) 该问题可以分解为若干个规模较小的相同问题,即该问题具有最优子结构性质。 3) 利用该问题分解出的子问题的解可以合并为该问题的解; 4) 该问题所分解出的各个子问题是相互独立的,即子问题之间不包含公共的子问题。 -Voronoi Diagram algorithm is mainly using the method of pa
Code
- 我一直用的几何板,功能包括凸包、半平面交等-I use geometric panels, features a more comprehensive
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
tsp_g
- 利用凸包的原理,求解70个城市的旅行商问题.用Matlab实现-Using the principle of the convex hull of the traveling salesman problem 70 cities. Implemented in Matlab
DEMDelaunay
- 生成Delaunay三角网,先自动生成点,再生成凸包,再生成三角网-Generating Delaunay triangulation, the first automatic generation point, and then generate the convex hull, and then generate triangulation
convexhull
- (计算机图形学) 凸包算法 用vba for cad编写 运用Jarvis march(包裹法) -convex hull (vba cad) using Jarvis march
Convex-hull
- 根据基于生成凸包的算法,编写一个自动生成凸包的程序- According to the convex hull based algorithm to generate, write a program to automatically generate the convex hull
tubao
- 寻找凸包算法的MFC可视化实现,对大家学习会有帮助。-Find convex hull algorithm MFC Visualization.
drilling-vibration-
- 调用matlab程序,利用凸包原理,实现了钻柱振动监测,程序源代码可见,但实测数据保密-Call matlab procedures, the use of convex hull principle, to achieve the drill string vibration monitoring, program source code visible, but the measured data privacy
jmMixing
- 利用Csharp编程语言实现某些常用的空间分析算法,要求具备基本的图文功能界面,所有实验均集成在同一系统中,要求实现如下功能 1.曲线抽样算法的实现 要求采用2种不同的算法进行曲线抽样,并分别对抽样的效果进行评价和比较。 2.离散点群空间分布参数的计算 要求计算空间点群的各种空间分布参数,如分布密度、各种分布中心、分布轴线、离散度等。 3.曲线插值与光滑算法的实现 要求利用任意两种不同的插值算法实现曲线的插值与光滑,并进行对比分析。 4.膨胀系数的计算与最小凸包的
draw-the-outline-of-the-convex-hull
- OPENCV学习代码,绘制轮廓的凸包,对初学者有一定帮助-OPENCV learning code, draw the outline of the convex hull, based programming Opencvd of C++
convex_hull
- 凸包问题的算法实现,graham算法实现,分治算法以及暴力算法,有简单图形界面-Convex Hull algorithm problem, graham algorithm, divide and conquer algorithms and violence algorithm, a simple graphical interface