polygon多边形的相交计算

大约有10种排序方法，如堆排序、快速排序、归并排序、插入排序、外壳排序、选择排序、早泡排序、线性排序、地址选择排序和基排序。我自己提出了一种简化的快速排序。-about 10 species of sequencing methods, such as heap sort, quick sort, merge, in order to insert sequencing, shell sort, select, in order of ranking as foam, linear ordering, sequencing and address choice-based ranking. I propose a simplified Quick Sort.

此程序绘制在 visual studio c + + 的计算机图形 3D 对象中使用 opengl 的犹他茶壶。此代码摘自补充材料，为 Chapter.This 程序为犹他茶壶、 茶杯和茶勺，使用数据集，并生成贝塞尔曲面使用 OpenGL 评价

求解整数的最大公约数-the common denominator for Solving Integer

求解一阶常微分方程的两个欧拉法，先前欧拉和改进梯形法。-solving a differential equation 2 Euler, Euler and improve previous trapezoidal method.

聚类分析对图像进行聚类分析，分析效果极好，可直接用。-k means

本代码演示了马走日棋盘搜索算法。-demonstration of the code Ma days away chessboard search algorithm.

本代码做的是无线传感器定位算法，该算法计算精确大大提高了定位精度，减少节点损耗

本算法为哈弗曼编码，主要为手动输入一个字符串，自动统计字符种类和权值，进行哈弗曼编码。要译码的话输入二进制代码，进行译码...

unlike kalman filter this filter is more suitable to deal with nonlinear data types. the source code is of omnet++ simulators. which contains a c++ file and other two files is used for network description and the general initialization files.

这是Badming写的一些关于AI的c++代码，他认为现代的脚本语言实际上是未来Ai的前身。当代码复杂到一定程度，程序给人类的反应，人类已经分不清是不是死的代码或是真的有意识产生了。-This is a Badming written about AI in c++ code, he thinks of modern scripting language is actually the predecessor of the future of Ai. When the code is complex and to a certain extent, the program" s response to mankind, mankind has not distinguish the code is not dead, or really awareness created.