TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Smoothening complex polygons - Ramer–Douglas–Peucker algorithm

30 pointsby ideamonkover 14 years ago

4 comments

uxguyover 14 years ago
Another interesting discussion on it - <a href="http://stackoverflow.com/questions/1849928/how-to-intelligently-degrade-or-smooth-gis-data-simplifying-polygons" rel="nofollow">http://stackoverflow.com/questions/1849928/how-to-intelligen...</a>
评论 #2035716 未加载
nitrogenover 14 years ago
I'm sure they exist, so can anyone point to extensions of the concept to piecewise-Bézier curves (as opposed to piecewise linear).
评论 #2037843 未加载
评论 #2036092 未加载
cullenkingover 14 years ago
Was happy to see this come across HN. I had bookmarked several notes and a PHP implementation of this. I am planning on using this to simplify the number of points defining a particular path on a google map, for a small preview map. Some of my data is &#62; 1 meg for a long route, so trimming is important.<p>Check out a live PHP demo: <a href="http://www.fonant.com/demos/douglas_peucker/algorithm" rel="nofollow">http://www.fonant.com/demos/douglas_peucker/algorithm</a>
kungfooeyover 14 years ago
This would be interesting/useful for smoothing geospatial polygons (eg, KML).
评论 #2036219 未加载
评论 #2039379 未加载
评论 #2036148 未加载