Welcome![Sign In][Sign Up]
Location:
Search - Douglas Peuker

Search list

[Other resourceDouglas

Description: Douglas-Peuker算法压缩地图线数据
Platform: | Size: 4260740 | Author: 曹阳 | Hits:

[GIS programDouglas

Description: Douglas-Peuker算法压缩地图线数据-Douglas-Peuker map line data compression algorithm
Platform: | Size: 4260864 | Author: 曹阳 | Hits:

[OtherDouglas-Pcucker

Description: 用Douglas-Pcucker算法对线状地图进行自动综合。-employ the Douglas-Pcucker algorithm for the 2D linear map generalization.
Platform: | Size: 3659776 | Author: wubaiyan | Hits:

[Otherdouglas

Description: 道格拉斯压缩算法的实现,附带数据,可以设定压缩参数-Douglas compression algorithm, with data compression parameters can be set
Platform: | Size: 4274176 | Author: 叶樱 | Hits:

[Graph RecognizeDouglas-Pcucker

Description: \Douglas-Pcucker算法的源代码和解析-Douglas-Pcucker
Platform: | Size: 7194624 | Author: 肖坤 | Hits:

[Otherzuuoye--douglas

Description: 道克拉斯-匹克线压缩算法,利用vb实现。-Road Klass- Pick line compression algorithm, using vb implementation.
Platform: | Size: 44032 | Author: 李志粉 | Hits:

[AI-NN-PRDouglas-Peuker

Description: Douglas一Peukcer算法由D.Douglas和T.Peueker于1973年提出,简称D一P算法,是目前公认的线状要素化简经典算法。现有的线化简算法中,有相当一部分都是在该算法基础上进行改进产生的。它的优点是具有平移和旋转不变性,给定曲线与阂值后,抽样结果一定。 算法的基本思路是:对每一条曲线的首末点虚连一条直线,求所有点与直线的距离,并找出最大距离值dmax ,用dmax与限差D相比:若dmax < D ,这条曲线上的中间点全部舍去 若dmax ≥D ,保留dmax 对应的坐标点,并以该点为界,把曲线分为两部分,对这两部分重复使用该方法。 -Douglas a Peukcer algorithm proposed in 1973 by the D.Douglas and T.Peueker, referred to as D a P algorithm, is now recognized as a classic linear feature simplification algorithm. Existing line simplification algorithm, a considerable part of the algorithm is based on the improvements generated. Its advantage is a translational and rotational invariance, the value of a given curve and Ae, sampling results must. The basic idea of ​ ​ the algorithm is: even a straight line for each curve of the first and last point is true, seek from all points with a straight line, and find the value of the maximum distance dmax, dmax and tolerance compared with D: If dmax < D, which the middle point of the curve on all the discarded If dmax ≥ D, keep dmax corresponding coordinate point, and that point for the community, the curve is divided into two parts, both parts of the repeated use of the method.
Platform: | Size: 11264 | Author: windowsbbs | Hits:

[Graph programDouglas-Peuker

Description: 道格拉斯普克算法,用于轨迹或者地图形状压缩; 这类算法在地理信息系统中有大量的类似算法,并且有很多研究人员予以了改进(Douglas Peucker algorithm for trajectory or map shape compression; This kind of algorithm has a large number of similar algorithms in the geographic information system, and many researchers have improved it.)
Platform: | Size: 98304 | Author: shuranyishunjian | Hits:

CodeBus www.codebus.net