Global Curve Simplification
From MaRDI portal
Publication:5075813
DOI10.4230/LIPIcs.ESA.2019.67OpenAlexW2976149974MaRDI QIDQ5075813
Carola Wenk, Irina Kostitsyna, Maarten Löffler, Mees van de Kerkhof, Majid Mirzanezhad
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1809.10269
Related Items
Embedding ray intersection graphs and global curve simplification ⋮ Fréchet Distance for Uncertain Curves ⋮ Place the Vertices Anywhere on the Curve and Simplify
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Near-linear time approximation algorithms for curve simplification
- A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
- Ray shooting in polygons using geodesic triangulations
- Efficiently approximating polygonal paths in three and higher dimensions
- Polygonal path simplification with angle constraints
- Optimal simplification of polygonal chain for rendering
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- Matching planar maps
- 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
- Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
- Polyline simplification has cubic complexity
- Streaming algorithms for line simplification
