Optimal simplification of polygonal chains for subpixel-accurate rendering

DOI10.1016/j.comgeo.2008.03.002zbMath1152.65032MaRDI QIDQ950399

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

zbMATH Keywords

polygonal chain; graphical examples; accurate rendering; breadth-first traversal; digital line-segment; query method

Mathematics Subject Classification ID

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

Related Items

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