Progressive simplification of polygonal curves

DOI10.1016/J.COMGEO.2020.101620MaRDI QIDQ2306367zbMATH OpenOpenAlexFDO

Authors Kevin Buchin, Maximilian Konzack, Wim Reddingius

Publication date 23 March 2020

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1806.02647

zbMATH Keywords

computational geometrycurve simplificationline simplification

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: Simplifying polygonal curves at different levels of detail is an important problem with many applications. Existing geometric optimization algorithms are only capable of minimizing the complexity of a simplified curve for a single level of detail. We present an $O(n^{3}m)$-time algorithm that takes a polygonal curve of n vertices and produces a set of consistent simplifications for m scales while minimizing the cumulative simplification complexity. This algorithm is compatible with distance measures such as the Hausdorff, the Fr'echet and area-based distances, and enables simplification for continuous scaling in $O(n^5)$ time. To speed up this algorithm in practice, we present new techniques for constructing and representing so-called shortcut graphs. Experimental evaluation of these techniques on trajectory data reveals a significant improvement of using shortcut graphs for progressive and non-progressive curve simplification, both in terms of running time and memory usage.

Recommendations

• scientific article; zbMATH DE number 1947379
• Near-linear time approximation algorithms for curve simplification
• SimpliPoly: curvature-based polygonal curve simplification
• Speeding up simplification of polygonal curves using nested approximations
• On optimal polyline simplification using the Hausdorff and Fréchet distance

Cites work

• scientific article; zbMATH DE number 4074316 (Why is no real title available?)
• A Fast $O(N)$ Multiresolution Polygonal Approximation Algorithm for GPS Trajectory Simplification
• A note on two problems in connexion with graphs
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• Area-preserving approximations of polygonal paths
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Distance-preserving approximations of polygonal paths
• Incremental algorithms for minimal length paths
• Near-linear time approximation algorithms for curve simplification
• The pairing heap: A new form of self-adjusting heap

Cited in

(11)

• Place the vertices anywhere on the curve and simplify
• Simplifying massive planar subdivisions
• Compressing spatio-temporal trajectories
• SimpliPoly: curvature-based polygonal curve simplification
• Polyline simplification has cubic complexity
• Speeding up simplification of polygonal curves using nested approximations
• Geodesic-preserving polygon simplification
• Straightening polygonal arcs and convexifying polygonal cycles
• Uncertain Curve Simplification
• Area-preserving subdivision simplification with topology constraints: exactly and in practice
• Shortcut hulls: vertex-restricted outer simplifications of polygons

This page was built for publication: Progressive simplification of polygonal curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2306367)