Polyline simplification has cubic complexity
From MaRDI portal
Publication:5088945
DOI10.4230/LIPICS.SOCG.2019.18MaRDI QIDQ5088945FDOQ5088945
Authors: Karl Bringmann, Bhaskar Chaudhury 
Publication date: 18 July 2022
Recommendations
Cites Work
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Map simplification with topology constraints: exactly and in practice
- Near-linear time approximation algorithms for curve simplification
- Efficiently approximating polygonal paths in three and higher dimensions
- Title not available (Why is that?)
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- Title not available (Why is that?)
- Simplifying a polygonal subdivision while keeping it simple
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Title not available (Why is that?)
- Polygonal path simplification with angle constraints
- Title not available (Why is that?)
- Completeness for first-order properties on sparse structures with algorithmic applications
- On some fine-grained questions in algorithms and complexity
- On optimal polyline simplification using the Hausdorff and Fréchet distance
- Streaming algorithms for line simplification
Cited In (1)
This page was built for publication: Polyline simplification has cubic complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088945)
