Polygonal Path Approximation: A Query Based Approach

In this paper we present a new, query based approach for approximating polygonal chains in the plane. We give a few results related with this approach, some of more general interest, and propose a greedy heuristic to speed up the computation. We also give an O(n log n) time, factor 2 approximation algorithm with infinite beam criterion. Finally, we show that the query based approach can be used to obtain a subquadratic time exact algorithm with infinite beam criterion and Euclidean distance metric if some condition on the input path holds.

[1]  Leonidas J. Guibas,et al.  Fractional cascading: II. Applications , 1986, Algorithmica.

[2]  A. Melkman,et al.  On Polygonal Chain Approximation , 1988 .

[3]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[4]  Helmut Alt,et al.  Approximation of Convex Polygons , 1990, ICALP.

[5]  Ovidiu Daescu.  New Results on Path Approximation , 2003, Algorithmica.

[6]  Michael T. Goodrich,et al.  Efficiently Approximating Polygonal Paths in Three and Higher Dimensions , 1998, SCG '98.

[7]  Luigi P. Cordella,et al.  An O(N) algorithm for polygonal approximation , 1985, Pattern Recognit. Lett..

[8]  Godfried T. Toussaint,et al.  On Approximating Polygonal Curves in Two and Three Dimensions , 1994, CVGIP Graph. Model. Image Process..

[9]  Ovidiu Daescu,et al.  Space-Efficient Algorithms for Approximating Polygonal Curves in Two-Dimensional Space , 2003, Int. J. Comput. Geom. Appl..

[10]  Joseph S. B. Mitchell,et al.  Simplifying a polygonal subdivision while keeping it simple , 2001, SCG '01.

[11]  Leonidas J. Guibas,et al.  Fractional cascading: I. A data structuring technique , 1986, Algorithmica.

[12]  Leonidas J. Guibas,et al.  Approximating Polygons and Subdivisions with Minimum Link Paths , 1991, Int. J. Comput. Geom. Appl..

[13]  W. S. Chan,et al.  Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum error , 1996, Int. J. Comput. Geom. Appl..

[14]  M. Iri,et al.  Polygonal Approximations of a Curve — Formulations and Algorithms , 1988 .

[15]  Hiroshi Imai,et al.  An optimal algorithm for approximating a piecewise linear function , 1986 .

[16]  D. Avis,et al.  Simple On-Line Algorithms for Convex Polygons , 1985 .

[17]  Hiroshi Imai,et al.  Computational-geometric methods for polygonal approximations of a curve , 1986, Comput. Vis. Graph. Image Process..

[18]  M. V. Kreveld,et al.  Topologically correct subdivision simplification using the bandwidth criterion , 1998 .

[19]  S. Louis Hakimi,et al.  Fitting polygonal functions to a set of points in the plane , 1991, CVGIP Graph. Model. Image Process..

[20]  Pankaj K. Agarwal,et al.  Efficient Algorithms for Approximating Polygonal Chains , 2000, Discret. Comput. Geom..

[21]  Marc Noy,et al.  Separating objects in the plane by wedges and strips , 2001, Discret. Appl. Math..

[22]  Nabil H. Mustafa,et al.  Near-Linear Time Approximation Algorithms for Curve Simplification , 2002, ESA.