搜索资源列表
hull
- 一个相当不错的凸包生成程序，对大家学习有挺好的帮助-a pretty good convex hull generation procedures, we have very good learning with the help of
hull
- Hull三角网生成算法三角网生成算法,VB实现.Delaunay三角网生成算法,VB实现.-Hull TIN algorithm TIN algorithm, VB. Delaunay Triangulation generation algorithm, VB.
JAVA中实现Convex Hull算法
- 实现Convex Hull算法的JAVA源代码。
convex-hull.rar
- This code computes the 3D convex hull of a points set.,This code computes the 3D convex hull of a points set.
DTin
- 基于VC++6.0环境编写， TIN生成算法是DEM的重要算法之一， 提供从离散点生成TIN的凸包收缩方法, 可以保存生成的点跟线的自定义的文本文档， 程序仅供参考-Based on VC++6.0 environment for the preparation of. TIN is generated from a point to provide the convex hull of contraction method , Can save th
minboundrect
- 基于凸壳边界的最小外接矩形拟合MATLAB程序。-Convex hull boundary based on the minimum bounding rectangle fitting MATLAB.
convex
- 程序实现图像分块，凸包，分割等功能，学图像处理的朋友建议下载。-Image sub-block implementation procedures, convex hull, partition and other functions, the study image processing Friend recommended download.
convexhull
- 用动态链表实现求凸壳的程序（卷包裹法），供三角网实现编程的人参考-Using dynamic list for the Convex Hull of the realization of procedures (vol Parcel law) for the triangular network programming reference
TSP_G
- 在分离粘连颗粒时通过求取凸包从而得到凸缺，进而找到分离点-Adhesions in the separation of particles through the strike in order to be convex convex hull missing, and then find the separation point
Delaunayjiyusuiyoutuke
- 基于最优凸壳技术的Delaunay三角剖分算法-Convex Hull based on optimal technology Delaunay triangulation algorithm
convexhull_Grahamscan
- Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S in
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
graham
- Graham convex hull sofware
chull_3dConvexHull
- 求空间点集的三维凸包。chull.cpp, chull.h。来自计算几何英文原著作者个人网站。-computer 3D convex hull of a set of points. The set of points are not on a same plane.
Planer_convex_hull
- A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put
Convex_hull.cpp.tar
- ACM凸包标程,可以快速使用凸包的各种应用，满足需求。-ACM convex hull source file
qhull
- Quick hull implementation
Hull
- 凸包算法实现三角网的构建 Convex hull of the triangulation algorithm to build-Convex hull triangulation algorithm to build the Convex hull of the triangulation algorithm to build
Convex_Hull_Algorithm
- 由一堆离散点，自动生成它的最小外包多边形，及凸壳。-By a bunch of discrete points, it is automatically generated out of the smallest polygon, and the Convex Hull.
ConvexHull
- Convex Hull Algorithm Implemetation in ASP C#