Global Curve Simplification

Due to its many applications, curve simplification is a long-studied problem in computational geometry and adjacent disciplines, such as graphics, geographical information science, etc. Given a polygonal curve P with n vertices, the goal is to find another polygonal curve P' with a smaller number of vertices such that P' is sufficiently similar to P. Quality guarantees of a simplification are usually given in a local sense, bounding the distance between a shortcut and its corresponding section of the curve. In this work we aim to provide a systematic overview of curve simplification problems under global distance measures that bound the distance between P and P'. We consider six different curve distance measures: three variants of the Hausdorff distance and three variants of the Frechet distance. And we study different restrictions on the choice of vertices for P'. We provide polynomial-time algorithms for some variants of the global curve simplification problem, and show NP-hardness for other variants. Through this systematic study we observe, for the first time, some surprising patterns, and suggest directions for future research in this important area.

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

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

[3]  Lilian Buzer.  Optimal simplification of polygonal chain for rendering , 2007, SCG '07.

[4]  Maarten Löffler,et al.  On Optimal Polyline Simplification using the Hausdorff and Fréchet Distance , 2018, SoCG.

[5]  John Hershberger,et al.  Polygonal path simplification with angle constraints , 2005, Comput. Geom..

[6]  Leonidas J. Guibas,et al.  Ray shooting in polygons using geodesic triangulations , 1991, Algorithmica.

[7]  Nabil H. Mustafa,et al.  Near-Linear Time Approximation Algorithms for Curve Simplification , 2005, Algorithmica.

[8]  Jorge Urrutia,et al.  A Simple Proof of the Representation of Bipartite Planar Graphs as the Contact Graphs of Orthogonal Straight Line Segments , 1998, Inf. Process. Lett..

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

[10]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[11]  Michael Godau,et al.  A Natural Metric for Curves - Computing the Distance for Polygonal Chains and Approximation Algorithms , 1991, STACS.

[12]  Karl Bringmann,et al.  Polyline Simplification has Cubic Complexity , 2018, SoCG.

[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]  Sariel Har-Peled,et al.  Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts , 2012, SIAM J. Comput..

[15]  Dieter Pfoser,et al.  On Map-Matching Vehicle Tracking Data , 2005, VLDB.

[16]  Mark de Berg,et al.  Streaming Algorithms for Line Simplification , 2010, Discret. Comput. Geom..

[17]  Nobuji Saito,et al.  NP-Completeness of the Hamiltonian Cycle Problem for Bipartite Graphs , 1980 .

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

[19]  Maarten Löffler,et al.  On the complexity of minimum-link path problems , 2016, J. Comput. Geom..

[20]  Günter Rote,et al.  Matching planar maps , 2003, SODA '03.

[21]  Leonidas J. Guibas,et al.  Visibility of disjoint polygons , 2005, Algorithmica.