Optimal simplification of polygonal chain for rendering

DOI10.1145/1247069.1247102zbMath1221.05297OpenAlexW4298497687MaRDI QIDQ3602873

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)

Related Items (7)

Tangential cover for thick digital curves ⋮ Embedding ray intersection graphs and global curve simplification ⋮ Efficient observer-dependent simplification in polygonal domains ⋮ Place the Vertices Anywhere on the Curve and Simplify ⋮ Tangential Cover for Thick Digital Curves ⋮ Global Curve Simplification ⋮ On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance

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