文件名称:Douglas-Peuker
- 所属分类：
- 人工智能/神经网络/遗传算法
- 资源属性：
- [Windows] [Visual C] [源码]
- 上传时间：
- 2013-12-01
- 文件大小：
- 11kb
- 下载次数：
- 0次
- 提 供 者：
- windo*****
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
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.
算法的基本思路是:对每一条曲线的首末点虚连一条直线,求所有点与直线的距离,并找出最大距离值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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Douglas-Peuker
..............\1.txt
..............\2.txt
..............\DouglasPeuker.cpp
..............\DouglasPeuker.dsp
..............\DouglasPeuker.dsw
..............\jpl_vegetation_grass.txt
..............\jpl_vegetation_grass2.txt
..............\ReadMe.txt
..............\StdAfx.cpp
..............\StdAfx.h