Progressive simplification of polygonal curves

DOI10.1016/j.comgeo.2020.101620zbMath1432.68500arXiv1806.02647OpenAlexW3004917642MaRDI QIDQ2306367

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)

Cites Work

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

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