Streaming algorithms for line simplification
From MaRDI portal
Publication:5919922
DOI10.1007/S00454-008-9132-4zbMATH Open1186.68485OpenAlexW2029619478MaRDI QIDQ5919922FDOQ5919922
Mohammad A. Abam, Peter Hachenberger, Alireza Zarei, Mark de Berg
Publication date: 12 April 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-008-9132-4
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Fitting polygonal functions to a set of points in the plane
- Efficient piecewise-linear function approximation using the uniform metric
- A space-optimal data-stream algorithm for coresets in the plane
- Near-linear time approximation algorithms for curve simplification
- Efficient algorithms for approximating polygonal chains
- Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
Cited In (8)
- Title not available (Why is that?)
- Global Curve Simplification
- On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance
- Computing homotopic line simplification
- Embedding ray intersection graphs and global curve simplification
- Place the Vertices Anywhere on the Curve and Simplify
- Shortcut hulls: vertex-restricted outer simplifications of polygons
- Efficient observer-dependent simplification in polygonal domains
This page was built for publication: Streaming algorithms for line simplification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919922)
