algorithm - Simplified (or smooth) polygons that contain the original detailed polygon -


i have detailed 2d polygon (representing geographic area) defined large set of vertices. i'm looking algorithm simplify , smooth polygon, (reducing number of vertices) constraint area of resulting polygon must contain vertices of detailed polygon.

for context, here's example of edge of 1 complex polygon:

enter image description here

my research:

thanks advice can give me!

edit

as of 2013, links below not functional anymore. however, i've found the cited paper, algorithm included, still available @ (very slow) server.


here can find project dealing issues. although works area "filled" points, can set work "perimeter" type definition yours.

it uses k-nearest neighbors approach calculating region.

samples:

enter image description here

here can request copy of paper.

seemingly planned offer online service requesting calculations, didn't test it, , isn't running.

hth!


Comments

Popular posts from this blog

apache - Add omitted ? to URLs -

redirect - bbPress Forum - rewrite to wwww.mysite prohibits login -

php - How can I stop spam on my custom forum/blog? -