Multiresolution Approximation of Polygonal Curves in Linear Complexity

Details Multiresolution Approximation of Polygonal Curves in Linear Complexity Multiresolution Approximation of Polygonal Curves in Linear Complexity

2007-05-03

arxiv.org/abs/0705.0449v1

Computer Science

Computer Vision and Pattern Recognition

Scientific paper

We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality between successive levels of resolution using dynamic programming. We show theoretically and experimentally that this algorithm has a linear complexity in time and space. We experimentally compare the outcomes of our algorithm to the optimal "full search" dynamic programming solution and finally to classical merge and split approaches. The experimental evaluations confirm the theoretical derivations and show that the proposed approach evaluated on 2D coastal maps either show a lower time complexity or provide polygonal approximations closer to the input discrete curves.

Affiliated with

Also associated with

No associations

Rating

Multiresolution Approximation of Polygonal Curves in Linear Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multiresolution Approximation of Polygonal Curves in Linear Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiresolution Approximation of Polygonal Curves in Linear Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-497089