6
votes
1answer
82 views

Competing approaches to line & polygon simplification

There seems to be a few theoretical options around at the moment for geometric simplification. Douglas–Peucker seems the most established, followed by Visvalingam's approach (used by d3.js). Now ...
1
vote
1answer
131 views

Algorithm to move polygon nodes when simplifying

I want to simplify polygons that come from a raster analysis. In order to avoid overlap and gaps, I first convert my polygons to lines. The problem is that all algorithm are then keeping the two end ...
7
votes
2answers
318 views

Lossless Polygon Simplification?

Is there a standard/recommended algorithm for simplifying a polygon without shrinking any of its original boundaries? Right now I'm using TopologyPreservingSimplifer within JTS and running into ...
4
votes
1answer
259 views

Simplification algorithms for 3D topology

My problem is about simplifying a given topology that can be opened ( an usual 3D reconstruction of a given square on a map ), totally closed (like a perfect sphere) or a topology with holes ( a ...
19
votes
3answers
2k views

Meaning of Simplify's tolerance parameter

The standard parameters of Douglas-Peucker's simplify algorithm are geometry and tolerance (e.g ST_Simplify in PostGIS). What's the meaning of the tolerance parameter? I know that the bigger the ...