A Split-Merge-Split Approach to Polygonal Approximation of Chain-Coded Curve
Bimal Kumar Ray · International Journal of Computer Graphics · 2015
This paper proposes a technique for polygonal approximation of chain-coded curve after relaxing the definition of digital straight segment. The initial approximation is modified by merging quasi linear vertices followed by insertion of additional vertices. The entire process involves comparison and computation on integral domain. It uses an approximation of perpendicular distance which is shown to impose an upper bound on perpendicular distance. The experimental results show improvement upon a similar work.