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:
my research:
i found ramer–douglas–peucker algorithm reduce number of vertices - resulting polygon not contain of original polygon's vertices. see article ramer-douglas-peucker on wikipedia
i considered expanding polygon (i believe known outward polygon offsetting). found these questions: expanding polygon (convex only) , inflating polygon. don't think substantially reduce detail of polygon.
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:
here can request copy of paper.
seemingly planned offer online service requesting calculations, didn't test it, , isn't running.
hth!
Comments
Post a Comment