Simplification of polylines by segment collapse: minimizing areal displacement while preserving area

Abstract

This paper reports on a new Area Preserving Segment Collapse (APSC) algorithm for simplifying polygonal boundaries while preserving the polygonal area at simplified target scales and minimizing areal displacement. A general segment collapse algorithm is defined by iteratively collapsing segments to Steiner points in priority order, guided by placement and displacement functions. The algorithm is specified by defining functions that minimize areal displacement under the constraint that the areas of adjoining polygons are preserved exactly. Self-intersections can be avoided by testing for intersections with two new line segments associated with each segment collapse operation. The paper demonstrates simplification results for a sample of 10 lakes formed from alpine, Karst, glacial and arid desert processes as well as artificial dams. APSC results are compared with three other simplification routines and evaluated for area preservation, linear and areal displacement, complexity and introduction of boundary self-intersections. Results confirm that the APSC algorithm preserves area exactly and indicate that it outperforms the other tested algorithms for minimizing areal displacement while producing reasonably low measures of linear displacement. Self-intersections can occur more commonly with APSC than other algorithms but are avoided with the proposed topology check. The APSC algorithm additionally preserves polygon complexity better than other tested algorithms.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 20 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.