Geodesic-Preserving Polygon Simplification

Polygons are a paramount data structure in computational geometry. While the complexity of many algorithms on simple polygons or polygons with holes depends on the size of the input polygon, the intrinsic complexity of the problems these algorithms solve is often related to the reflex vertices of the polygon. In this paper, we give an easy-to-describe linear-time method to replace an input polygon \(\mathcal{P}\) by a polygon \(\mathcal{P}'\) such that (1) \(\mathcal{P}'\) contains \(\mathcal{P}\), (2) \(\mathcal{P}'\) has its reflex vertices at the same positions as \(\mathcal{P}\), and (3) the number of vertices of \(\mathcal{P}'\) is linear in the number of reflex vertices. Since the solutions of numerous problems on polygons (including shortest paths, geodesic hulls, separating point sets, and Voronoi diagrams) are equivalent for both \(\mathcal{P}\) and \(\mathcal{P}'\), our algorithm can be used as a preprocessing step for several algorithms and makes their running time dependent on the number of reflex vertices rather than on the size of \(\mathcal{P}\).

[1]  Leonidas J. Guibas,et al.  Approximating Polygons and Subdivisions with Minimum Link Paths , 1991, ISA.

[2]  Rephael Wenger,et al.  Constructing Pairwise Disjoint Paths with Few Links , 1997, WADS.

[3]  S. Suri.  A linear time algorithm with minimum link paths inside a simple polygon , 1986 .

[4]  Prosenjit Bose,et al.  A generalized Winternitz Theorem , 2011 .

[5]  David Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

[6]  Steven Skiena,et al.  On Minimum-Area Hulls , 1998, Algorithmica.

[7]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[8]  Joseph S. B. Mitchell,et al.  Shortest Paths and Networks , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[9]  Avraham A. Melkman,et al.  On-Line Construction of the Convex Hull of a Simple Polyline , 1987, Inf. Process. Lett..

[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]  Boris Aronov,et al.  The furthest-site geodesic voronoi diagram , 1993, SCG '88.

[12]  J. Mark Keil,et al.  Polygon Decomposition , 2000, Handbook of Computational Geometry.

[13]  Leonidas J. Guibas,et al.  Optimal Shortest Path Queries in a Simple Polygon , 1989, J. Comput. Syst. Sci..

[14]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[15]  D. T. Lee,et al.  A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains , 1998, Algorithmica.

[16]  Alexander Pilz,et al.  Extreme point and halving edge search in abstract order types , 2013, Comput. Geom..

[17]  Erik D. Demaine,et al.  Separating Point Sets in Polygonal Environments , 2005, Int. J. Comput. Geom. Appl..

[18]  Leonidas J. Guibas,et al.  Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons , 1987, Algorithmica.

[19]  Subir Kumar Ghosh,et al.  Visibility Algorithms in the Plane , 2007 .

[20]  Bettina Speckmann,et al.  Allocating Vertex π-Guards in Simple Polygons via Pseudo-Triangulations , 2003, SODA '03.

[21]  John Hershberger,et al.  Computing Minimum Length Paths of a Given Homotopy Class , 1994, Comput. Geom..

[22]  Subhash Suri,et al.  An Optimal Algorithm for Euclidean Shortest Paths in the Plane , 1999, SIAM J. Comput..

[23]  Joseph S. B. Mitchell,et al.  L1 shortest paths among polygonal obstacles in the plane , 1992, Algorithmica.

[24]  Prosenjit Bose,et al.  Geodesic Ham-Sandwich Cuts , 2004, SCG '04.

[25]  Boris Aronov,et al.  On the geodesic voronoi diagram of point sites in a simple polygon , 1989, SCG '87.

[26]  Joseph S. B. Mitchell,et al.  Minimum-link paths revisited , 2013, Comput. Geom..

[27]  Francisco Santos,et al.  Pseudo-Triangulations - a Survey , 2006 .

[28]  Kurt Mehlhorn,et al.  Fast Triangulation of Simple Polygons , 1983, FCT.

[29]  G. Toussaint.  Computing geodesic properties inside a simple polygon , 1989 .

[30]  Marc Noy,et al.  Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon , 1996, Comput. Geom..

[31]  D. Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

[32]  Alexander Pilz,et al.  Geodesic Order Types , 2013, Algorithmica.