1. 20 Apr, 2021 1 commit
    • Volker Krause's avatar
      Produce valid results when simplifying areas close to the threshold · 412453b1
      Volker Krause authored
      When the simplified area extends not significantly more than the size
      threshold in one direction, the result of the Douglas Peucker algorithm
      can deteriorate into a area-less polygon. In this case we fall back to
      the bounding box instead now.
      It's not that those small features have much practical impact, but the
      resulting broken polygons cause problems in subsequent use.
  2. 19 Apr, 2021 1 commit
    • Volker Krause's avatar
      Basic simplification of coverage polygons · 14fd9ac7
      Volker Krause authored
      This uses the Douglas Peucker algorithm with a 10km threshold, which
      already yields useful results. This however still needs better handling
      of multi-polygons, and polygon offsetting by the threshold.