Optimal simplification of polygonal chains for subpixel-accurate rendering
From MaRDI portal
Publication:950399
DOI10.1016/J.COMGEO.2008.03.002zbMATH Open1152.65032OpenAlexW2092057647MaRDI QIDQ950399FDOQ950399
Authors: Lilian Buzer 
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
Recommendations
graphical examplespolygonal chainaccurate renderingbreadth-first traversaldigital line-segmentquery method
Cites Work
- Title not available (Why is that?)
- Maintenance of configurations in the plane
- Fitting polygonal functions to a set of points in the plane
- Dynamic planar convex hull operations in near-logarithmic amortized time
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
- Efficient algorithms for approximating polygonal chains
- Polygonal chain approximation: A query based approach
- On-line construction of the convex hull of a simple polyline
- Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
- Title not available (Why is that?)
- Farthest-point queries with geometric and combinatorial constraints
- New results on path approximation
Cited In (6)
- Simplifying a polygonal subdivision while keeping it simple
- Computing homotopic line simplification
- Area-preserving subdivision simplification with topology constraints: exactly and in practice
- On the Farey sequence and its augmentation for applications to image analysis
- Optimal simplification of polygonal chain for rendering
- Efficient observer-dependent simplification in polygonal domains
This page was built for publication: Optimal simplification of polygonal chains for subpixel-accurate rendering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950399)
