搜索资源列表
333
- 求凸多边形最优三角剖分。用动态规划问题有效解决该问题。多边形是平面上一条分段线形封闭曲线。-Optimal convex polygon triangulation. Dynamic programming problem with an effective solution to the problem. Sub-polygon is a plane closed curve linear.
ConvexHulls
- 凸包，使用先左右排序再计算上凸包下凸包的方法，效率还可以。-Convex hull, and then calculated using the first order around the convex hull on the package approach, efficiency gains can be.
Desktop
- 数字图像处理中的形态学 matlab凸集裁剪程序-Morphological convex cut
GPSR_6.0
- This set of MATLAB files contain an implementation of the gradient projection algorithms described in the paper "Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems" by Mario A. T. Figueiredo, R
displayHex
- 利用《计算机图形学》中给出的范例进行修改得到的凸多边形的加速旋转动画-Accelerate the rotation animation of the example given in the "Computer Graphics" to modify the convex polygon
fenge
- 将n（n>=3）顶点的凸多边形分割成三角形组合的简单算法-Convex polygon is divided into a triangle combination of simple algorithms
xxl
- 平均互信息是信源概率的上凸函数,是信道概率的下凸函数,该软件展示他们平面图与三维可视图.直观.-The average mutual information source probability convex function, convex function of the probability of channel, the software shows they plan and 3D view. Intuitive.
robust_1
- 利用凸优化方法求解估计信道的预编码，具体需要参考stphen boy 的凸优化工具包-solve the precoder by convex method
TarsusPmultiplication
- 分治法大整数乘法课件 概述：算法概要、算法效率 合并排序 快速排序 折半查找 大整数乘法 Strassen 矩阵乘法 分治法解凸包 -Divide and conquer integer multiplication courseware about the function and some problems very effective way to solve the that serious .I think it will be ok!
Some-CS--Rconstruction-Algorithm
- Some Matlab CS Reconstruction Algorithm Codes such as greedy pursuit_OMP,COSaMP,SP Convex Optimization _BP algorithm,LP,IHT and TVq algorithm, TVqc. We use one picture to Check these Algorithm.-Some Matlab CS Reconstruction Algorithm Codes such as gr
CaiJian1--
- MFC做的图形处理，关于线段的裁剪，包括参数化法的凸多边形裁剪算法和Cohen-SutherLand裁剪算法。-MFC to do graphics processing, cut on the line, including the parameterization of the convex polygon clipping algorithm, and Cohen-Sutherland clipping algorithm.
graham
- Graham扫描算法 ： 大体思路是将不是凸包顶点的点从点集中去掉。 找出S中具有最小y坐标的点p（通过选取最左边的点打破平局） 根据点和p的连线 与 x轴正方向所成的角度，对S中的点进行排序（由小到大），并将p放在最前面。 从p点开始扫描排序后的S集合。如果这些点都在凸包上，则每三个相继的点p1,p2,p3满足以下性质：p3在向量<p1,p2>的左边.如果出现相继的三个点p1,p2,p3不满足上述性质，则p2点一定不是凸包的顶点，应立即去除。-Grah
GIS-tuqiao
- 给定点群凸壳生成算法,GIS的核心算法之一。-Generate the core algorithm of the algorithm, GIS is one of the convex hull of a given point group
fun_approch
- 压缩感知共轭梯度的基追踪算法。里面详细写了该算法的源程序。希望可以供大家学习。-this is the Gradient Projection for Linearly Constrained Convex Optimization in Sparse Signal Recovery
CONVEXHULL
- 周培德翻译的《计算几何:算法设计与分析》中的凸包算法，在Visual Studio2008平台用C#语言编写的基于页面的二维凸包生成程序。本人拥有自主版权！-Zhou s translation, "Computational Geometry: algorithm design and analysis" of the convex hull algorithm, written in C# in Visual Studio2008 platform packet generation pa
L1_magic
- 程序包包括了求解稀疏信号重构的凸优化方法。具体实现了基于 primal-dual 的线性规划方法（LPs）和基于 log-barrier 的二阶锥规划方法（SOCPs）。-Sparse signal recovery via convex programming is given in the pakage. The Lps are using generic primal-dual method, and the SOCPs are solved with a generic log-barr
shiyan
- 将背景与前景从视频中分割开 并将前景进行多边形或凸包处理-Background and foreground separated from the video and The foreground polygon or convex hull
metric-learning_survey_v2
- 关于metric learning的综述，涉及到许多的知识：SVM、kernel、SDP等-This paper surveys the field of distance metric learning from a principle perspective, and includes a broad selection of recent work. In particular, distance metric learning is reviewed under different
haiye
- 池塘里有n片荷叶（1≤n≤1000），它们正好形成一个凸多边形。按照顺时针方向将这n片荷叶顺次编号为1，2，…，n。 有一只小青蛙站在1号荷叶上，它想跳过每片荷叶一次且仅一次（它可以从所站的荷叶跳到任意一片荷叶上）。同时，它又希望跳过的总距离最短-Pond, the n tablets lotus leaf (1 ≤ n ≤ 1000), they just form a convex polygon. These n piece lotus leaf sequential number a
Ndiantuduobianxing
- N个点能否构成凸多边形，程序简单，易于读懂-Whether the N points constitute a convex polygon, the program is simple, easy to read