TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Smoothening complex polygons - Ramer–Douglas–Peucker algorithm

30 点作者 ideamonk超过 14 年前

4 条评论

uxguy超过 14 年前
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 未加载
nitrogen超过 14 年前
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 未加载
cullenking超过 14 年前
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>
kungfooey超过 14 年前
This would be interesting/useful for smoothing geospatial polygons (eg, KML).
评论 #2036219 未加载
评论 #2039379 未加载
评论 #2036148 未加载