Efficient observer-dependent simplification in polygonal domains
From MaRDI portal
Publication:2428687
DOI10.1007/s00453-011-9488-3zbMath1236.68283OpenAlexW2139532350MaRDI QIDQ2428687
Alireza Zarei, Mohammad Ghodsi
Publication date: 26 April 2012
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.379.8960
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Area-preserving approximations of polygonal paths
- On-line construction of the convex hull of a simple polyline
- Computing minimum length paths of a given homotopy class
- Efficient piecewise-linear function approximation using the uniform metric
- Efficient algorithms for approximating polygonal chains
- A space-optimal data-stream algorithm for coresets in the plane
- Optimal simplification of polygonal chain for rendering
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- Fitting polygonal functions to a set of points in the plane
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Streaming algorithms for line simplification
This page was built for publication: Efficient observer-dependent simplification in polygonal domains
