搜索资源列表
algorithms-master
- 1. 经典的算法实现 2. 服务器端 3. 正确，易于使用和改造, 一个头文件一个算法，并附带一个demo. 1. 一个算法用一个.h文件表示放到include下.2. 算法演示的demo程序放到src下.3. 程序正确通过后，请发起Pull Requests，代码被验证后入库，并在README中发布新算法实现。 已实现 ( Implemented ): Array shuffle Prime test(trial division) Prime test(Mi
2Dmath
- 2D math algorithm library to manipulate 2D vectors and matrix
CVector
- 2D、3D、4D向量类，包含操作符重载 -2D, 3D, 4D vector class includes operator overloading，class CVector2,class CVector3,class CVector4
MaxPointsonaLine
- Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. 分析：首先要注意的是，输入数组中可能有重复的点。由于两点确定一条直线，一个很直观的解法是计算每两个点形成的直线，然后把相同的直线合并，最后包含点最多的直线上点的个数就是本题的解。我们知道表示一条直线可以用斜率和y截距两个浮点数（垂直于x轴的直线斜率为无穷大，截距用x截距），同时还需要保存每
Binary-Inddexed-Tree
- 一个树状数组各种改造姿势的模板。除了常规用法单点查询求前缀和外，支持区间修改单点查询、区间修改区间求和、RMQ、离线平衡树以及多维扩展-Many improved versions of binary indexed tree. Which can be used to do these kinds of work in a 1D array: Change one point+k and get the prefixsum Change a range+k and get value
Max-Points-on-a-Line
- 给定的n个点在二维平面上,发现的最大数量点躺在同一直线。-Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.
cfd2d
- This program was written for cfd simulation with 2D.
k-means-2d-rand-point
- K_means经典聚类算法，用点阵可视化 通过产生随机点，不断更改中心点实现聚类-K Means classic clustering algorithm, with lattice visualization By generating random points, and constantly change the center point to achieve clustering
seidel-1.0.tar
- seidel三角剖分，快速2d 三角剖分算法-seidel triangulation triangulation algorithm fast 2d