搜索资源列表
1228
- POJ 1228 求解凸包， 并判断凸包每条边上点的数量-Tu Bao
2
- 用C#编写的计算凸包的程序，可以运行，代码简单。-Calculated using C#, the convex hull of the program, you can run the code simple.
3
- 凸包算法的界面化实现，可以计算点集的凸包。-The interface of the convex hull algorithm to achieve, we can calculate the convex hull of point set.
5
- 用C#开发的凸包程序，在屏幕上任意画点，可形成点集的凸包。-C# developers with an interface program, suitable for beginners to learn C#.
1
- C++编写的凸包运算程序，可以生成平面上点集的凸包。-C++ programs written in the convex hull operation, the plane can generate the convex hull of point set.
4
- C++编写的最小凸包算法，能够生成点集的凸包。-Written in C++ Algorithm for Convex Hull algorithm to generate the convex hull of point set.
convexhull_
- 算法设计 凸包问题 C程序开发的，需要配置OPENGL文件才能运行-tubao wenti suanfaseji good function program! have a good job ok la!
tubaoC
- C#编写的凸包算法,计算机图形学中的东西~C#编写-tubao convex hull algorithm Oh good things
tubao
- 算法课程中一个给出N个点和坐标，求取一个凸包的程序-Algorithm for a course coordinates are given N points and strike a convex program
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
JavaConvexHall
- 实现Java凸包算法，但是有一些小问题，例如数组越界。-Convex hull algorithm that implements the Java
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