道格拉斯-普克算法 (Douglas– Peucker algorithm，亦称为拉默-道格拉斯-普克算法、迭代适应点算法、分裂与合并算法)是将曲线近似表示为一系列点，并减少点的数量的一种算法。它的优点是具有平移和旋转不变性，给定曲线与阈值后，抽样结果一定。
The Douglas - puke algorithm (Douglas - Peucker algorithm, also called the lamer - Douglas - puke algorithm, iterative adaptive point algorithm, split and merge algorithm) is an algorithm that approximatively represents a curve as a series of points and reduces the number of points. It has the advantages of translation and rotation invariance. After a given curve and threshold, the sampling result is certain. (2018-06-17, C#, 74KB, 下载2次)
一个关于网吧更新软件 网维大师数据库 来同步 更新 查询 导出 创建快捷的工具
A software update on Internet to synchronize network dimensional master database update query export tool to create fast (2011-07-15, C#, 265KB, 下载4次)