scientific article; zbMATH DE number 7559218
From MaRDI portal
Publication:5088945
DOI10.4230/LIPIcs.SoCG.2019.18MaRDI QIDQ5088945
Bhaskar Chaudhury, Karl Bringmann
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Near-linear time approximation algorithms for curve simplification
- Efficiently approximating polygonal paths in three and higher dimensions
- Polygonal path simplification with angle constraints
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance
- ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY
- Map Simplification with Topology Constraints: Exactly and in Practice
- Simplifying a polygonal subdivision while keeping it simple
- Streaming algorithms for line simplification
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
