搜索资源列表
SortPoint
- 如何将无序的多边形顶点集合，排序成逆时针顺序!这个正是凸包算法前面的一些准备工作!-how to disorderly polygon vertex assembly, sequencing into a counter-clockwise order! This is why the convex hull algorithm front of some preparation work!
Project5037735
- A game of triangle, it create convex hull nestedly and then does triangulation. Then player can play like GO.-triangle. it create convex hull and then does nestedly tri angulation. Then player can play like GO.
chull
- Computational Geometry in C 书中的源代码 生成三维凸包-Computational Geometry book in the C source code generated 3D convex hull
convhull
- 设平面上n个点为 ，坐标原点为 。可按照下面方法求得包含这n个点的凸多边形。 (1)求最右边点，即x坐标最大点，设为 。 (2) 以 点为中心，在其余 个点中选取与 逆时针旋转角度最小的点，设为 。 (3)再以 点为中心，在其余 个点中选取与 逆时针旋转角度最小的点 。如此类推，直到新选取的点与 点重合为止。设已求得多边形k个点依次为 ，其中第 点与第1点重合。则分别以点 为三角形顶点计算面积并求和即可。 -Let n points in the plane as the
MPI-Geometry
- 部分几何问题的MPI源码，包括包含、相交和凸壳问题。-Some geometric problems MPI source code, including the inclusion, intersection and convex hull problems.
tubao
- 实现点集凸包的算法，把众多随机分布的点用一条折线以最小的长度使其全部包括其中-Achieve point set convex hull algorithms, the number of random distribution of points with a polyline with a minimum length of it all including the
tubao
- 算法课程中一个给出N个点和坐标，求取一个凸包的程序-Algorithm for a course coordinates are given N points and strike a convex program
erciguihua
- 用拉格朗日法求解等式约束的凸二次规划 用起作用集法求解不等式约束的凸二次规划 用路径跟踪法求解不等式约束的凸二次规划 -Lagrangian method for solving equality constraints convex quadratic programming work set method for solving inequality constraints convex quadratic programming path tracking method for
convexhull
- 对平面上n个点，求取凸包，并求该凸包面积-convex hull for n points。
concave
- matlab表面微结构生成源代码 图片中凹包凸包检测方法 -generate source code Matlab surface microstructure picture concave envelope convex hull detection method
YALL1-v1.4
- 新版的求解L1范数最小化问题的凸优化工具包-new version for solve L1-norm minimization problem of convex optimization
Algorithm-analysis-
- 算法分析与设计论文附加代码,动态规划解决凸多边形的最优三角分割和回溯法解决哈密顿回路问题-Algorithm analysis and design thesis additional code, dynamic programming to solve the optimal convex polygon triangulation and backtracking to solve the problem Hamiltonian circuit
quadprog-1.2.1.tar
- 二次规划包This file is part of QuadProg++: a C++ library implementing the algorithm of Goldfarb and Idnani for the solution of a (convex) Quadratic Programming problem by means of an active-set dual method.-Quadprog++ 1.2.1
simulate
- 使用DC算法求解非凸函数的最优化问题。可以确保局部最优解，有时收敛到全局最优-DC algorithm using optimization problem of non-convex function. Ensure local optima, sometimes converge to the global optimum
lmi
- 俞立老师书本例题的仿真程序，凸优化，最优解，可行性等问题。对线性不等式的编程有很好的参考性-Yu Li, teacher simulation of the book program, convex optimization, the optimal solution, feasibility and other issues. The programming of linear inequalities has a good reference