Global Curve Simplification
From MaRDI portal
Publication:5075813
DOI10.4230/LIPICS.ESA.2019.67OpenAlexW2976149974MaRDI QIDQ5075813FDOQ5075813
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- Matching planar maps
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Jaywalking your dog: computing the Fréchet distance with shortcuts
- Ray shooting in polygons using geodesic triangulations
- Near-linear time approximation algorithms for curve simplification
- Efficiently approximating polygonal paths in three and higher dimensions
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal simplification of polygonal chain for rendering
- Polygonal path simplification with angle constraints
- A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
- Title not available (Why is that?)
- Polyline simplification has cubic complexity
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
- On optimal polyline simplification using the Hausdorff and Fréchet distance
- Streaming algorithms for line simplification
Cited In (4)
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)
