Efficient Algorithms for Approximating Polygonal Chains

• 1 February 2000
• journal article
• research article
• Published by Springer Nature in Discrete & Computational Geometry
• Vol. 23  (2) , 273-291
• https://doi.org/10.1007/pl00009500

Abstract

Keywords

• EFFICIENT ALGORITHM
• TIME ALGORITHM
• ERROR CRITERION
• RANDOMIZED ALGORITHM
• POLYGONAL CHAIN