Global Curve Simplification
From MaRDI portal
Publication:5075813
Recommendations
Cites work
- scientific article; zbMATH DE number 6707504 (Why is no real title available?)
- scientific article; zbMATH DE number 4026646 (Why is no real title available?)
- scientific article; zbMATH DE number 3694608 (Why is no real title available?)
- scientific article; zbMATH DE number 176499 (Why is no real title available?)
- scientific article; zbMATH DE number 193423 (Why is no real title available?)
- A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Efficiently approximating polygonal paths in three and higher dimensions
- Jaywalking your dog: computing the Fréchet distance with shortcuts
- Matching planar maps
- Near-linear time approximation algorithms for curve simplification
- On optimal polyline simplification using the Hausdorff and Fréchet distance
- Optimal simplification of polygonal chain for rendering
- Polygonal path simplification with angle constraints
- Polyline simplification has cubic complexity
- Ray shooting in polygons using geodesic triangulations
- Simplifying 3D Polygonal Chains Under the Discrete 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)