Speeding up Simplification of Polygonal Curves using Nested Approximations

Details Speeding up Simplification of Polygonal Curves using Nested Approximations Speeding up Simplification of Polygonal Curves using Nested Approximations

2007-09-12

arxiv.org/abs/0709.1941v3

Pattern Analysis & Applications (2008) 1-8

Computer Science

Computational Geometry

12 pages + figures

Scientific paper

10.1007/s10044-008-0133-y

We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used between any two successive levels of resolution satisfies some conditions, the multiresolution algorithm MR will have a complexity lower than the complexity of A. In particular, we show that if A has a O(N2/K) complexity (the complexity of a reduced search dynamic solution approach), where N and K are respectively the initial and the final number of segments, the complexity of MR is in O(N).We experimentally compare the outcomes of MR with those of the optimal "full search" dynamic programming solution and of classical merge and split approaches. The experimental evaluations confirm the theoretical derivations and show that the proposed approach evaluated on 2D coastal maps either shows a lower complexity or provides polygonal approximations closer to the initial curves.

Affiliated with

Also associated with

No associations

Rating

Speeding up Simplification of Polygonal Curves using Nested Approximations 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 Speeding up Simplification of Polygonal Curves using Nested Approximations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Speeding up Simplification of Polygonal Curves using Nested Approximations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-23078