Optimal simplification of polygonal chain for rendering

DOI10.1145/1247069.1247102zbMATH Open1221.05297OpenAlexW4298497687MaRDI QIDQ3602873FDOQ3602873

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

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

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)

Cited In (9)

• Global Curve Simplification
• On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance
• Tangential cover for thick digital curves
• Tangential Cover for Thick Digital Curves
• Embedding ray intersection graphs and global curve simplification
• Place the Vertices Anywhere on the Curve and Simplify
• Title not available (Why is that?)
• Optimal simplification of polygonal chains for subpixel-accurate rendering
• Efficient observer-dependent simplification in polygonal domains

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)