搜索资源列表
TSPconvhull
- for solving for TSP, with TSPconvhull that K = convhull(x,y) returns indices into the x and y vectors of the points on the convex hull.
InertiaEngine-0.1.1-bin
- InertiaEngine 是一个使用C++编写的2D 刚体物理特性仿真器，可跨平台使用，还包含多边形碰撞检测算法，支持碰撞反应，静态摩擦，动态摩擦。-InertiaEngine is a 2D rigid body physic engine written in C++ and is not OS dependent. It is designed to be very user friendly. It contains also a 2D convex polygon collision
coplqp.tar
- 内点法求解凸二次规划 COPL_QP是一个可用的凸二次规划实验的解。这个软件包试图解决线性约束凸二次规划。源代码用C语言编写，附带用户指南（postscr ipt文件）和问题实例-Interior point method for solving convex quadratic programming
proj1
- 在Windows系统中，安装GLUT库：打开glut-3.7.6-bin.zip，取出glut.h，glut32.lib，glut32.dll，分别放置。 使用Visual Studio C++编译已有项目工程，并修改代码生成以下图形： 在此基础上，修改各顶点颜色，使得每个顶点颜色不一样，多边形内部颜色渐变。 操作方法和实验步骤： 1.使用GL_POLYGON模式绘制白色的多边形，由于所绘多边形为凹多边形，故从最左上角的点开始绘制，以防得到不可预测的图形。注意求得各凹角(refl
tubao
- 实现点集凸包的算法，把众多随机分布的点用一条折线以最小的长度使其全部包括其中-Achieve point set convex hull algorithms, the number of random distribution of points with a polyline with a minimum length of it all including the
2DBall
- 有关2D凸包的算法，1. 排序更简单，只是简单的比较，没有运算. 2. 起始点更好找，就是排序后的第一个点. 3. 可以很好地处理特殊情况(共线).-The 2D convex hull algorithm, 1. Sorting easier, just a simple comparison, there is no operation. 2. To find a better starting point, that is sort of a point after the fir
duobianxing
- 多边形，可以画任何的凸多边形 多边形，可以画任何的凸多边形-Polygon, convex polygon can draw any polygon, convex polygon can draw any
Morphological
- Here we use mathematical morphology as a tool to extract useful forms and structures and shapes such as boundaries, skeletons, convex hull. Dilation and Erosion
Opengl
- OpenGl实现的凸多边形裁剪任意多边形算法-OpenGl implementation of arbitrary polygon convex polygon clipping algorithm for
QuadProg
- Visual Studio 2005 环境下，C++ 实现的求解凸二次规划的算法源代码。-a C++ implementing algorithm for a (convex) Quadratic Programming problem by means of an active-set dual method.
HW04_allegro
- convex hull problem with source code
tuke
- 凸壳生成动画演示，MFC实现，点若干个点，利用卷包裹法自动演示凸壳生成。-Convex hull is generated animation, MFC implementation, point a number of points, the use of volume parcels France presentation convex hull is generated automatically.
howto_convex_hull
- convex hull to determine the hu-convex hull to determine the hull
ConvexHull
- Convex Hull algorithms
Convex_hullAlgorithm
- 实用的凸包算法，包括计算点与水平线的夹角，二分法排序，找极点等。-A practical convex hull algorithm, including calculating angle of the point and horizontal line, dichotomy sort, looking for poles and so on.
graham
- 构造凸包接口函数,传入原始点集大小n,点集p(p原有顺序被打乱!),返回凸包大小,凸包的点在convex中-Construct convex hull interface function, introduced the original point set size n, the point set p (p the original order has been disrupted!), Returns the size of the convex hull, convex hull of
sanjiaopoufen
- 实现凸多边形的三角剖分，c++源代码，拷到编译器下即可调试运行，没错误，不想下的很多程序代码调试有错误。-Achieve convex polygon triangulation, c++ source code, copying it to debug the compiler can be run under, no errors, do not want to debug code under a lot of mistakes.
Convexhull
- 凸包 凸包问题的实现 有无数点，求能包含这些点的图形的最小面积-Convex hull Convex hull problem of realization there are numerous points, seek to include these points, the graphics, the minimum size
Shell3D
- 三维场景中的三维凸壳算法及实现。可用鼠标转动场景，可用鼠标拖动凸壳的各顶点。-Three-dimensional scene in three-dimensional convex hull algorithm and implementation.
InPolyedron
- 为凸多边形检测边和点的，可以用于分割，流行中-IN POLYGON TEST FOR CONVEX POLYGON This submission has inspired the following: IN POLYGON TEST FOR CONVEX POLYGON