搜索资源列表
lysnake
- 提出了一种自适应的Snake 算法,对于初始包络上的每一点,按照Greedy 算法中的能量公式计算其邻域内各点的能 量. 如果邻域不包含目标的轮廓,则将邻域半径加大,再次计算邻域内各点的能量,直到邻域内包含轮廓点为止. 该算法只需迭 代一次即可得到目标轮廓,而且增大了初始包络的收敛半径,并能够有效处理较高曲率凸形边缘的情况. 对比实验说明了这种 方法的有效性.-Snake proposed an adaptive algorithm, the initial envelope for
coe
- 单核苷酸多态性(SNPs)数据与全基因组关联研究 COE:凸优化的上位性检测算法 -Single nucleotide polymorphisms (SNPs) data and genome-wide association study COE: convex optimization epistasis detection algorithm
convexMRF-v1.0.src
- 基于文献“对偶凸代价网络流问题算法在计算机视觉中的应用”对于凸网络流问题的一种原始对偶算法的实现-An implementation of the primal-dual method for the dual of the convex network flow problem ("Convex Markov Random Fields") described in New Algorithms for the Dual of the Convex Cost Networ
005H
- 输入N个点的坐标，判断这N个点能否构成一个凸多边形。-Enter the coordinates of N points to determine whether these N points form a convex polygon.
92311385
- 介绍一个CButton的派生类CLinkButton，用此派生类制作的按钮具有以下特点： 1、按钮的外观类似静态控件类CStatic 产生的对象。 2、当鼠标的光标移到按钮上，但并未按下时，光标改变形状，字体改变形状；按钮类似应用在工具条和菜单上的扁平钮效果。 3、当按钮按下时有立体感（凹凸）。-Introduce a CButton derived class CLinkButton, use this button to create a derived class has th
GrahamScan
- Graham凸包扫描算法，算法速度快，很经典的，程序内部注释比较全面。-Graham scan algorithm for convex hull algorithm is fast, very classic, more comprehensive program within the comment.
GraphicsBlanking
- 利用VC++编写的简单的3D图像消隐算法，可以对凸多面体进行图像消隐-Using VC++ written in a simple 3D image blanking algorithm, the image can be convex polyhedron blanking
cvx_usrguide
- CVX使用向导，专门用于求解凸优化问题，快速，使用方便。-CVX using the wizard, designed to solve convex optimization problems, fast, easy to use.
convexl
- The convex hull of a set of points is the smallest convex set that contains the points. This paper presents a convex hull algorithm that combines the 2-d Quickhull algorithm with the general dimension.
GSConvexHull-CPP
- convex hull c++ code
Convexhullproblem
- 点集Q的凸包(convex hull)是指一个最小凸多边形，满足Q中的点或者在多边形边上或者在其内-The convex hull of point set Q (convex hull) is a minimum convex polygon, to meet the Q of the point or the edge of or within this polygon
hull
- 该代码实现由点集序列或数组创建凸外形，基于OPENCV-The code sequence or set of points achieved by the convex shape to create an array, based on OPENCV
class
- 凸多面体的线消隐,C++实现的，一个比较简单的程序-Convex polyhedron of the line blanking
cvx
- 凸优化算法,实现凸优化的求解，应用在最优化的设计和参数估计中-convex program
dlg
- 利用MFC，简单的图形界面，简单的算法，实现凸包的绘制-Using MFC, a simple graphical interface, a simple algorithm to achieve the convex hull of the draw
ConvHull2D
- 计算几何中的凸包求解算法，效率比较高，并且容易使用，直接调用即可-computing geometry to compute the convex of a set of points.
polyJudge
- 判断是否是凸多边形，包含可视化界面，用户输入。-Determine whether a convex polygon that contains visual interface, user input.
Simplex_
- Simplex algorithm - an optimization algorithm for solving linear programming problems by searching the vertices of a convex polyhedron in multidimensional space.
l1magic-1.1
- `1-magic : Recovery of Sparse Signals via Convex Programming
tuke
- 凸壳的生成是计算机图形学中的基本图形处理算法，本程序是演示生成凸壳的c++源码 -Convex hull of computer graphics generation is the basic graphics algorithms, this procedure is to demonstrate the Convex Hull of generating c++ source code