New results on path approximation

DOI10.1007/S00453-003-1046-1MaRDI QIDQ1889587zbMATH OpenOpenAlexFDO

Authors Ovidiu Daescu

Publication date 2 December 2004

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-003-1046-1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Algorithms and Computation
• Polygonal chain approximation: A query based approach
• Efficiently approximating polygonal paths in three and higher dimensions
• SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
• Area-preserving approximations of polygonal paths

Cited in

(2)

• Optimal simplification of polygonal chains for subpixel-accurate rendering
• Algorithms and Computation

This page was built for publication: New results on path approximation

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