Optimal simplification of polygonal chains for subpixel-accurate rendering

DOI10.1016/J.COMGEO.2008.03.002MaRDI QIDQ950399zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graphical examplespolygonal chainaccurate renderingbreadth-first traversaldigital line-segmentquery method

Mathematics Subject Classification ID

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

Recommendations

• Optimal simplification of polygonal chain for rendering
• Efficient algorithms for approximating polygonal chains
• Polygonal chain approximation: A query based approach
• scientific article; zbMATH DE number 1947379
• Near-linear time approximation algorithms for curve simplification

Cites work

• scientific article; zbMATH DE number 741008 (Why is no real title available?)
• scientific article; zbMATH DE number 1436417 (Why is no real title available?)
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
• Dynamic planar convex hull operations in near-logarithmic amortized time
• Efficient algorithms for approximating polygonal chains
• Farthest-point queries with geometric and combinatorial constraints
• Fitting polygonal functions to a set of points in the plane
• Maintenance of configurations in the plane
• New results on path approximation
• On-line construction of the convex hull of a simple polyline
• Polygonal chain approximation: A query based approach
• SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE

Cited in

(6)

• Efficient observer-dependent simplification in polygonal domains
• Area-preserving subdivision simplification with topology constraints: exactly and in practice
• Optimal simplification of polygonal chain for rendering
• Computing homotopic line simplification
• Simplifying a polygonal subdivision while keeping it simple
• On the Farey sequence and its augmentation for applications to image analysis

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)