Polyline simplification has cubic complexity
From MaRDI portal
Publication:5088945
Recommendations
Cites work
- scientific article; zbMATH DE number 4074316 (Why is no real title available?)
- scientific article; zbMATH DE number 4082817 (Why is no real title available?)
- scientific article; zbMATH DE number 176499 (Why is no real title available?)
- scientific article; zbMATH DE number 2079389 (Why is no real title available?)
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Completeness for first-order properties on sparse structures with algorithmic applications
- Efficiently approximating polygonal paths in three and higher dimensions
- Map simplification with topology constraints: exactly and in practice
- Near-linear time approximation algorithms for curve simplification
- On optimal polyline simplification using the Hausdorff and Fréchet distance
- On some fine-grained questions in algorithms and complexity
- Polygonal path simplification with angle constraints
- Simplifying a polygonal subdivision while keeping it simple
- Streaming algorithms for line simplification
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)
