New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

generalization #1

Open

pikorcik opened this issue Sep 5, 2017 · 1 comment

Assignees

Collaborator

pikorcik commented Sep 5, 2017

Condition: less than 50 vertices per polygon

Deal with intersections of simplified polygons.

Collaborator Author

pikorcik commented Sep 5, 2017

Algorithm: https://en.wikipedia.org/wiki/Ramer%E2%80%93Douglas%E2%80%93Peucker_algorithm

See http://gdal.org/ogr__api_8h.html#ae7727c1e3f1aea8740020a75d150b09c

pikorcik assigned landam

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment