Global Curve Simplification

DOI10.4230/LIPICS.ESA.2019.67MaRDI QIDQ5075813zbMATH OpenOpenAlexFDO

Authors Mees van de Kerkhof, Irina Kostitsyna, Maarten Löffler, Majid Mirzanezhad, Carola Wenk

Publication date 11 May 2022

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

zbMATH Keywords

curve simplificationFréchet distanceHausdorff distance

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Progressive simplification of polygonal curves
• scientific article; zbMATH DE number 1947379
• Near-linear time approximation algorithms for curve simplification
• Polyline simplification has cubic complexity
• Polyline simplification has cubic complexity

Cites work

• A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Efficiently approximating polygonal paths in three and higher dimensions
• scientific article; zbMATH DE number 6707504 (Why is no real title available?)
• scientific article; zbMATH DE number 4026646 (Why is no real title available?)
• scientific article; zbMATH DE number 3694608 (Why is no real title available?)
• scientific article; zbMATH DE number 176499 (Why is no real title available?)
• scientific article; zbMATH DE number 193423 (Why is no real title available?)
• Jaywalking your dog: computing the Fréchet distance with shortcuts
• Matching planar maps
• Near-linear time approximation algorithms for curve simplification
• On optimal polyline simplification using the Hausdorff and Fréchet distance
• Optimal simplification of polygonal chain for rendering
• Polygonal path simplification with angle constraints
• Polyline simplification has cubic complexity
• Ray shooting in polygons using geodesic triangulations
• Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
• Streaming algorithms for line simplification

Cited in

(10)

• Embedding ray intersection graphs and global curve simplification
• Polyline simplification has cubic complexity
• Place the vertices anywhere on the curve and simplify
• Fréchet Distance for Uncertain Curves
• Uncertain Curve Simplification
• Minimum-complexity graph simplification under the Fréchet-like distance
• Dynamic L-budget clustering of curves
• Simplification of trajectory streams
• Faster Fréchet distance under transformations
• A dimension-reducing Fréchet simplification oracle

This page was built for publication: Global Curve Simplification

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