Optimal simplification of polygonal chain for rendering

DOI10.1145/1247069.1247102MaRDI QIDQ3602873zbMATHOpenAlexFDO

Authors Lilian Buzer

Publication date 12 February 2009

Published in Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1247069.1247102

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Optimal simplification of polygonal chains for subpixel-accurate rendering
• Efficient algorithms for approximating polygonal chains
• Near-linear time approximation algorithms for curve simplification
• SimpliPoly: curvature-based polygonal curve simplification
• Polygonal chain approximation: A query based approach

Cited in

(9)

• On optimal polyline simplification using the Hausdorff and Fréchet distance
• Tangential cover for thick digital curves
• Efficient observer-dependent simplification in polygonal domains
• Optimal simplification of polygonal chains for subpixel-accurate rendering
• Global Curve Simplification
• Embedding ray intersection graphs and global curve simplification
• Place the vertices anywhere on the curve and simplify
• Tangential Cover for Thick Digital Curves
• scientific article; zbMATH DE number 1747707 (Why is no real title available?)

This page was built for publication: Optimal simplification of polygonal chain for rendering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602873)