搜索资源列表
ConvexHull2
- 用增量算法生成凸壳-generate incremental algorithm using convex hull
划分凸边行
- acm中划分凸边行算法-acm were divided into convex side trip Algorithm
tb
- 凸包算法好东西哦-convex hull algorithm Oh good things
Intersect Segment with Polyhedron
- 线段与凸多边行的是否相交的判断-line with the convex multilateral OK to judge whether the intersection
tubao
- 模拟凸包的实现，只要随便点击一点，那么程序将自动寻找合适的点，将其连成凸包-simulation convex hull of achieving Just click 1:00, the process will automatically search for suitable spots, even as its convex hull
convex
- 经典的凸包算法。JAVA语言编写。绝对正确。
l1magic.tar
- l1-magic的matlab代码，l1-magic: Recovery of Sparse Signals via Convex Programming
gram
- 点集凸包Gram扫描法 c++程序-point set convex hull Gram scanning procedures c
Jarris
- 点集凸包( 收缩法)Jarris步进法-point set convex hull (contraction) Jarris Step Method
VC++ for draw
- 我自己在学习VC++时写的一个小程序，实现画凸多边形的功能，初学者值得一看-I am learning VC write a small program to achieve painting convex polygon functions, beginners eye-catcher
chull
- This code is described in \"Computational Geometry in C\" (Second Edition), Chapter 4. It is not written to be comprehensible without the explanation in that book. Input: 3n integer coordinates for the points. Output: the 3D convex hull,
genetic_src
- Genetic algorithm written in C#. It can be used to solve TSP, Time series, non-convex programming problems.
PhysXConvexGeometry
- Ageia s PhysX(著名的游戏物理库) D3D 9使用代码演示。由于PhysX物理库使用OpenGL代码实现图形着色，从而使许多用DirectX 3D的程序员不能使用/读懂demo代码，这是使用D3D着色引擎重新写的一些demo代码。-Convex Geometry（带执行文件）
1_Triangle
- 求解任意两个多边形的并集，交集，差集，要求是简单多边形，可以是凸多边形和凹多边形-solving arbitrary polygon and two sets, intersection, difference, the request is a simple polygon, it is concave and convex polygon Polygon
mypolygon
- 多边形常用算法模块 1. 判断多边形是否简单多边形2. 检查多边形顶点的凸凹性 3. 判断多边形是否凸多边形 4. 求多边形面积5. 判断多边形顶点的排列方向，方法一 6. 判断多边形顶点的排列方向，方法二 7. 射线法判断点是否在多边形内8. 判断点是否在凸多边形内-Does the polygon commonly used algorithm module 1. judgements polygons whether simple polygon. 2. inspections polyg
mypolygon2
- 8. 判断点是否在凸多边形内 9. 寻找点集的graham算法 10.寻找点集凸包的卷包裹法 11.判断线段是否在多边形内 12.求简单多边形的重心 13.求凸多边形的重心14.求肯定在给定多边形内的一个点15.求从多边形外一点出发到该多边形的切线16.判断多边形的核是否存在-8. In judging whether a convex polygon 9. Find points of graham algorithm 10. Find point set of convex hull vol
凸壳算法
- 凸壳算法，散点成三维体的方法，该方法从洋鬼子那得来的。-convex hull algorithm, scattered dots on the three-dimensional method from the foreign devils that comes from.
以K－均值聚类结果为初始解的模拟退火聚类
- 由于K－均值聚类算法局部最优的特点，而模拟退火算法理论上具有全局最优的特点。因此，用模拟退火算法对聚类进行了改进。20组聚类仿真表明，平均每次对K结果值改进8次左右，效果显著。下一步工作：实际上在高温区随机生成邻域是个组合爆炸问题（见本人上载软件‘k－均值聚类算法’所述），高温跳出局部解的概率几乎为0，因此正考虑采用凸包约束进行模拟聚类，相关工作正在进行。很快将奉献给各位朋友。-as K-means clustering algorithm for optimal local character
凸多边形中轴算法
- 这是一个凸多边形中轴算法：解压后在vc++6.0中运行即可，鼠标逆时针在客户区取点，如顺时针取点或形成的多边形为凹多边行，程序会自动退出（详情可参见代码）-This is a convex polygon axial algorithm : unpacked in vc 6.0 can be run, mouse anti-clockwise from the customer area, as a clockwise or take the form of concave polygon mu
2D
- C code for \"Computational Geometry in C (Second Edition)\": Code function Chapter pointer directory ----------------------------------------------------- Triangulate Chapter 1, Code 1.14 /tri Convex Hull(2D) Chapter 3, Code 3.8 /graham Convex Hull(