搜索资源列表
michel
- 用Michel积分法计算wigley船型兴波阻力-calculate the wave resistance of a wigley hull with the method of Michel integration
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.
ConvexHull
- 多边形凸壳构造,方便快捷效率高，可以用于理算点、多边形图客构造-Polygon Convex Hull Construction
ConvexHull
- 随机生成一些点，然后利用这些点生成凸包。-Randomly generated at some point, and then use these points to generate the convex hull.
convexhull
- Java implementation of fast convex hull algorithm
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
FastGEOver5.0.1
- FASTGEO 2D/3D Computational Geometry Algorithms Release Version 5.0.1 Author: Arash Partow 1997-2005 Copyright notice: Free use of the FastGEO computational geometry library is permitted under the guidelines and in accordance wit
Apples-occlusion-method-
- 为实现受果树枝叶遮挡、果实间相互遮挡的果实目标识别，该文提出了一种基于凸壳理论的遮挡苹果目 标识别方法。-To achieve obscured by the foliage of fruit trees, fruit fruit mutual occlusion between target identification, the paper proposes blocking Apple target recognition method based on convex hull the
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
ExtremeEdge
- calculate convex hull of random point by ExtremeEdge method
nonextreme_point
- determine convex hull for points by non extreme point method
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
convexhull
- convex hull code in java