搜索资源列表
mj
- 计算凸多边形面积，用c语言编程自动计算，vc6.0-Calculate convex polygon area, automatically calculated using c language programming, vc6.0
1_Triangle
- 求解任意两个多边形的并集，交集，差集，要求是简单多边形，可以是凸多边形和凹多边形-solving arbitrary polygon and two sets, intersection, difference, the request is a simple polygon, it is concave and convex polygon Polygon
ConvexHull
- 多边形凸壳构造,方便快捷效率高，可以用于理算点、多边形图客构造-Polygon Convex Hull Construction
duobianxing
- 多边形，可以画任何的凸多边形多边形，可以画任何的凸多边形-Polygon, convex polygon can draw any polygon, convex polygon can draw any
TwoLevelmodel
- matlab和C混编，处理乘性噪声，求解变差模型。-Written by M. Kang, S. Yun, and H. Woo, the corresponding paper is "Two-level convex relaxed variational model for multiplicative denoising"
ConvexHull
- 随机生成一些点，然后利用这些点生成凸包。-Randomly generated at some point, and then use these points to generate the convex hull.
primal-dual-algorithm
- Solve the standard basis pursuit program using a primal-dual algorithm,The key code of GBP is provided by Justin Romberg Reference: E. Candes and J. Romberg, “l1-Magic: Recovery of Sparse Signals via Convex Programming,” 2005.
cvx-w64
- 这是凸优化工具包，无需编程，能够直接调用，方便快捷-This is a convex optimization tool kit, without programming, can be called directly, convenient and quick
homework_algo
- 一凸 8 边形P 的顶点顺时针为{v1，v2，… ，v8}，任意两顶点间的线段的权重由矩阵D 给出。 若vi 与vj 是P 上不相邻的两个顶点，则线段vivj 称为P 的一条弦。求P 的一个弦的集合T， 使得T 中所有的弦恰好将P 分割成互不重迭的三角形，且各三角形的权重之和为最小（一 个三角形的权重是其各边的权重之和）。 -A convex polygon P 8 vertex clockwise {v1, v2, ..., v8}, any two vertices of t
TrackRoute
- 用路径跟踪法求解不等式约束的凸二次规划，即沿着此路径(或邻域)可以逼近问题的最优解。-With the path tracking method for solving inequality constrained convex quadratic programming, that along this path (or neighborhood) can approximate the optimal solution of the problem.
P0802
- 自已写的粘连字切割算法，轮廓检测,凸检测-Adhesions write their own words cut algorithm, contour detection, convex detection
PAPR_Reduction_ACE_POCS
- 代码中描述了用星座图扩展法（Active Constellation Extension，ACE）降低OFDM时域信号的PAPR，ACE的具体算法是凸集映射（Projection Onto Convex Sets，POCS）-These codes describe PAPR reduction using Active Constellation Extension (ACE). The detailed algorithm is Projection Onto Convex Sets (PO
array-pattern-synthesis
- 针对均匀线形阵列的阵列波束综合，并把这一问题描述成一个凸优化问题。-For array pattern synthesis problem, and describe it as a convex optimization problem.
optimal-beamforming
- 针对均匀线形阵列的阵列波束综合问题，并把这一问题描述成一个凸优化问题。针对更普适的情况。-For array pattern synthesis problem, and describe it as a convex optimization problem.
polarization-array-beamforming
- 针对极化阵列的波束综合问题，并把这一问题描述成一个凸优化问题。-For polarization array pattern synthesis problem, and describe it as a convex optimization problem.
GrahamFCH
- 本代码主要实现土包问题的算法，采用Graham扫描算法，随机生成指定数量的点，求解其凸包。代码中包含注释-The code of the main problems of soil packet algorithm, using Graham scan algorithm to randomly generate a specified number of points, solving its convex hull. Code contains annotations
shiyan3
- 实验3 简单多边形显示 实验目的：通过鼠标响应函数输入并显示多边形 基本内容： 通过鼠标依次输入n个顶点（n>=3），显示多边形。 建立多边形数据结构（保存顶点表、边信息，及其他信息） 用opengl显示多边形 拓展要求： 判断多边形的类型（自相交多边形，凹多边形，凸多边形） *若是凹多边形，则把多边形转换为多个凸多边形-Experiment 3 simple polygon display Purpose: response function by m
Algorithm-templates
- 算法模板，包括叉乘，多边形面积，凸包问题，线段相交等-Algorithm templates, including cross multiplication, polygon area, convex hull problem, line segment intersection, etc.
2
- 凸优化真题及相关代码程序，主要来源与斯坦福大学-Zhenti convex optimization and related code program, the main source of the Stanford University
A-Convex-Feature-Learning
- 国际顶级会议机器学习中的好文章，推荐给做机器学习的同志-paper in international top conference:ICML, strongly recommend it to those working in machine learning