Location:
Search - Douglas Peucker
Search list
Description: Douglas-Peucker算法 C#和VB
Douglas-Peucker算法
Douglas-Peucker算法
Platform: |
Size: 4652 |
Author: maya |
Hits:
Description: Douglas-Peucker算法
在数字化过程中，需要对曲线进行采样简化，即在曲线上取有限个点，将其变为折线，并且能够在一定程度
上保持原有的形状。
经典的Douglas-Peucker算法描述如下：
（1）在曲线首尾两点A，B之间连接一条直线AB，该直线为曲线的弦；
（2）得到曲线上离该直线段距离最大的点C，计算其与AB的距离d；
（3）比较该距离与预先给定的阈值threshold的大小，如果小于threshold，则该直线段作为曲线的近似，该段曲线处理完毕。
（4）如果距离大于阈值，则用C将曲线分为两段AC和BC，并分别对两段取信进行1~3的处理。
（5）当所有曲线都处理完毕时，依次连接各个分割点形成的折线，即可以作为曲线的近似。
Platform: |
Size: 20646 |
Author: shixcn |
Hits:
Description: Douglas－Peucker算法的递归实现，java版-Douglas-Peucker Compresing recursive algorithm to achieve, java version
Platform: |
Size: 4096 |
Author: 谭宁生 |
Hits:
Description: Douglas-Poiker抽稀算法（又称道格拉斯车抽稀），用于二维图形节点抽稀.-Douglas-Poiker pumped dilute algorithm (also known as Douglas cars pumping diluted), 2D graphics for pumping dilute nodes.
Platform: |
Size: 11264 |
Author: 张宁 |
Hits:
Description: 在计算机地图制图的过程中，通过各种手段获取的矢量数据往往存在各种各样的问题，需要对数据进行预处理，数据压缩是其中的一种处理方法。在计算机地图中，数据压缩的对象是线状要素中心轴线和面状要素边界数据(几何数据) ，本程序名称为道格拉斯－普克算法．-computer cartography in the process, through various means to obtain the vector data exists in a wide variety of issues, the need for data preprocessing, Data compression is one of these options. In the computer map, Data compression is targeted at the center axis of linear elements and the elements of the border facial data (geometric data) The procedure known as Douglas-Puke algorithm.
Platform: |
Size: 89088 |
Author: 杨毅 |
Hits:
Description: 地理信息系统中，曲线数据压缩的道格拉斯压缩算法源码-Geographic information systems, data compression curve of Douglas-source compression algorithm
Platform: |
Size: 14336 |
Author: dshgis |
Hits:
Description: 道格拉斯-普克曲线化简算法，有效减少矢量曲线上点的数量-Douglas- Peucker curve simplification algorithm, effectively reduce the vector of the number of curve points
Platform: |
Size: 1024 |
Author: tianfengmin |
Hits:
Description: When working with mathematical simulations or engineering problems, it is not unusual to handle curves that contains thousands of points. Usually, displaying all the points is not useful, a number of them will be rendered on the same pixel since the screen precision is finite. Hence, you use a lot of resource for nothing!
This article presents a fast 2D-line approximation algorithm based on the Douglas-Peucker algorithm (see [1]), well-known in the cartography community. It computes a hull, scaled by a tolerance factor, around the curve by choosing a minimum of key points. This algorithm has several advantages:
这是一个基于Douglas-Peucker算法的二维估值算法。-When working with mathematical simulations or engineering problems, it is not unusual to handle curves that contains thousands of points. Usually, displaying all the points is not useful, a number of them will be rendered on the same pixel since the screen precision is finite. Hence, you use a lot of resource for nothing! This article presents a fast 2D-line approximation algorithm based on the Douglas-Peucker algorithm (see [1]), well-known in the cartography community. It computes a hull, scaled by a tolerance factor, around the curve by choosing a minimum of key points. This algorithm has several advantages: It is a Douglas-Peucker algorithm based on two-dimensional valuation algorithm.
Platform: |
Size: 429056 |
Author: 成东 |
Hits:
Description: Douglas-Peucker算法 C#和VB
Douglas-Peucker算法
Douglas-Peucker算法-Douglas-Peucker algorithm C# And VBDouglas-Peucker algorithm for Douglas-Peucker algorithm
Platform: |
Size: 4096 |
Author: maya |
Hits:
Description: Douglas-Peuker算法压缩地图线数据-Douglas-Peuker map line data compression algorithm
Platform: |
Size: 4260864 |
Author: 曹阳 |
Hits:
Description: 计算机图形学，Douglas曲线拟合，Delphi源码，值得学习。-Computer Graphics, Douglas curve fitting, Delphi source code, it is worth learning.
Platform: |
Size: 10240 |
Author: mahuixun |
Hits:
Description: 道格拉斯-普克算法折线矢量压缩算法的C语言高效率实现，采用整形运算，适用于很多场合的数据压缩-Douglas- Peucker algorithm for line vector of the C language compression algorithms to achieve high efficiency, the use of plastic surgery operations, applicable to many occasions of data compression
Platform: |
Size: 3072 |
Author: amy chang |
Hits:
Description: 曲线数据压缩是计算机图形学、计算机自动制图和地理信息系统( GIS) 等学科理论与方法研究的一个重要问题,其实质是一个信息压缩问题.RDP 算法是应用最为广泛的一种,由于容易编程实现且压缩结果较好, GIS 界许多著名商业软件公司(如Intergrap h ,ESRI ,LaserScan) 都把此算法作为其制图系统中一种曲线数据压缩的标准算法.-the well-known Ramer-Douglas-Peucker (RDP) algorithm for polyline data compression
Platform: |
Size: 1024 |
Author: ann |
Hits:
Description: Program in lisp to clean a polyline with the douglas peucker algoritm
Platform: |
Size: 3072 |
Author: olivier_44 |
Hits:
Description: MFC程序，道格拉斯曲线压缩算法(Douglas-Pcucker),提供点数据，读取数据后绘制曲线，再进行压缩，显示压缩后的点，与原曲线进行对比，-Douglas-Pcucker Algorithm
Platform: |
Size: 2063360 |
Author: 郭旭 |
Hits:
Description: 道格拉斯-普克压缩算法,提取有用信息，提高信息集中度-Douglas- Puck compression algorithms to extract useful information
Platform: |
Size: 50176 |
Author: hotrice |
Hits:
Description: Douglas-Peucker算法压缩矢量数据是产生公共边“裂缝”现象的原因，Douglas-Peucker文章及部分程序-Douglas-Peucker algorithm for vector data compression is to generate public side "crack" phenomenon, Douglas-Peucker article and some of the procedures
Platform: |
Size: 2081792 |
Author: wanggen |
Hits:
Description: Douglas-Peucker是曲线拟合和压缩数据的最好方法，本人编辑这个程序方便大家调用，拟合压缩曲线。-Douglas-Peucker curve fitting and the compression of data is the best way, I called you to edit this program to facilitate the fitting compression curve.
Platform: |
Size: 3072 |
Author: huhoo |
Hits:
Description: 道格拉斯-普克算法(Douglas–Peucker algorithm，亦称为拉默-道格拉斯-普克算法、迭代适应点算法、分裂与合并算法)是将曲线近似表示为一系列点，并减少点的数量的一种算法。它的优点是具有平移和旋转不变性，给定曲线与阈值后，抽样结果一定。(Douglas Peucker algorithm is the curve approximated by a series of points, and reduce the number of points of an algorithm. It has the advantages of translation and rotation invariance, given the curve and the threshold, the sampling results must.)
Platform: |
Size: 3072 |
Author: 铭MARS花
|
Hits:
Description: 可以简化一条线段 使用douglas-peucker算法来实现 一个线段的简化(simple a line Can simplify a line segment use Douglas Peucker algorithm to simplify a line segment)
Platform: |
Size: 2048 |
Author: looker123 |
Hits: