A direction Change-based algorithm for polygonal approximation
ICPR（2012）
摘要
A linear-time algorithm is proposed for polygonal approximation of digital curves. The direction changes of the x- and y-coordinates are traced to generate a new, compact representation of curves. The algorithm, Direction Change-based Polygonal Approximation (DCPA), has two advantages: linear time complexity and insensitivity to parameter setting. Benchmark results demonstrate the competitive performance of DCPA using standard assessment techniques.
更多查看译文
关键词
insensitivity,image representation,y-coordinates,linear-time algorithm,x-coordinates,polynomial approximation,digital curves,parameter setting,computational complexity,direction change-based polygonal approximation,linear time complexity,dcpa,geometry,direction change-based algorithm
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要