搜索资源列表
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(
Convex Optimization算法优化
- Stephen Boyd Department of Electrical Engineering Stanford University Lieven Vandenberghe Electrical Engineering Department University of California, Los Angeles
Good paper on non convex problem
- U Toronto 大学的优化牛人 Weiyu的经典文章
TVL1_HCS_v1
- % May 2010 % This matlab code implements TVL1 based Hybrid Compressive Sensing using LSQR. % Only suitable the small scale data due to the costly storage and computation. % % A - M x N measurement matrix: random sampling alone or hybrid sampling (ran
凸优化工具箱CVX
- 斯坦福大学Grant和Boyd教授等开发的凸优化matlab最新工具箱(Windows版)-Stanford University Professor Boyd Grant and the development of new convex optimization toolbox matlab (Windows Version)
tessellation.rar
- 网格化[tessellation]即把凹多边形,包含洞,岛的多边型,或者自交叉多边型划分为简单凸多边形的过程.OpenGL为了能快速渲染多边形,只能直接显示简单凸多边形[多边形中任意两点的连线上的所有点仍属于此多边形],对凹多边或者自交叉多边形渲染结果将不确定。在渲染复杂多边形时,常常需要将复杂多边形分解成容易渲染的简单多边形,OpenGL中的使用函数库中提供网格化的函数以通过多边型轮廓线生成简单多边形,从而渲染复杂多边形。 ,Grid [tessellation] that is conca