Optimal simplification of polygonal chains for subpixel-accurate rendering
From MaRDI portal
Publication:950399
DOI10.1016/j.comgeo.2008.03.002zbMath1152.65032OpenAlexW2092057647MaRDI QIDQ950399
Publication date: 22 October 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.03.002
polygonal chaingraphical examplesaccurate renderingbreadth-first traversaldigital line-segmentquery method
Related Items (2)
On the Farey sequence and its augmentation for applications to image analysis ⋮ Computing homotopic line simplification
Cites Work
- Unnamed Item
- Unnamed Item
- Polygonal chain approximation: A query based approach
- On-line construction of the convex hull of a simple polyline
- Maintenance of configurations in the plane
- Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
- New results on path approximation
- Efficient algorithms for approximating polygonal chains
- Farthest-point queries with geometric and combinatorial constraints
- Dynamic planar convex hull operations in near-logarithmic amortized time
- Fitting polygonal functions to a set of points in the plane
- SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
This page was built for publication: Optimal simplification of polygonal chains for subpixel-accurate rendering
