搜索资源列表
minboundrect
- 基于凸壳边界的最小外接矩形拟合MATLAB程序。-Convex hull boundary based on the minimum bounding rectangle fitting MATLAB.
MyPolyStock
- 实现凸多边形排样，使用临界多边形NFP判断两个凸多边形是否相交,使用启发式算法提高效率-It s a good implement of convex polygon stock.
Convex
- 凸优化理论在信号处理中的应用，该理论很关键，希望大家多多学习！原版英文文档-Convex optimization theory in signal processing applications, the theory is critical, I hope to learn from you! Original English documentation
program
- 目标函数是De Jong函数，是一个连续、凸起的单峰函数-Objective function is De Jong function, is a continuous, convex function of the single-peak
thesisOFDMA-RessourceAllocation
- 一篇同学的硕士论文 --OFDMA Ressource Allocation using Multiuser Constant-Power Waterfilling. 关于OFDMA 资源分配的算法 用到凸优化(convex optimization)的理论 证明对多用户的Waterfilling算法可以实现优化原则-A master
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
bv_cvxslides
- stanford讲义 convex optimization 作者是Stanford著名教授 Boyd-stanford lectures convex optimization author is well-known Stanford Professor Boyd
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
convex2
- Convex constructed uisng Matlab
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
convex
- convex algorithm bodo
MESH-on-the-minimum-for-a-convex-body-surrounded.r
- 关于求一个MESH的最小凸包围体 所谓凸体， 就是从凸体内任意一点，向周围发射线，都只此MESH相交一次。-MESH on the minimum for a convex body surrounded the so-called convex body, convex body from any point, to launch around the line, only this time MESH intersection.
pocs
- 在matlab环境下基于pocs（凸集投影）的图像重建-Based in the matlab environment pocs (convex projection) of image reconstruction
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.