This shows you the differences between two versions of the page.

developer:sdksamples:polylinesimplification [2015/09/14] 127.0.0.1 external edit |
developer:sdksamples:polylinesimplification [2016/01/12] (current) sandy |
||
---|---|---|---|

Line 1: | Line 1: | ||

- | ====== How To: Simplify polylines ====== | + | ====== How to: Simplify Polylines ====== |

====== .NET ====== | ====== .NET ====== | ||

> **Summary:** //An implementation of the Douglas~Peucker polyline reduction algorithm// | > **Summary:** //An implementation of the Douglas~Peucker polyline reduction algorithm// | ||

Line 12: | Line 12: | ||

\\ | \\ | ||

- | First, the most basic reduction is assumed. A single segment connecting the beginning and end of the original polyline. This is when the recursion starts, the most significant vertex (the most distant) for this segment is found and, when the distance from this vertex to the segment exceeds the reduction tolerance, the segment is split into two sub-segments, each inheriting a subset of the original vertex list: | + | First, the most basic reduction is assumed. A single segment connecting the beginning and end of the original polyline. When the recursion starts, the most significant vertex (the most distant) for this segment is found. When the distance from this vertex to the segment exceeds the reduction tolerance, the segment splits into two sub-segments, each inheriting a subset of the original vertex list: |

\\ | \\ |

developer/sdksamples/polylinesimplification.txt ยท Last modified: 2016/01/12 by sandy