Area-Preserving Simplification and Schematization of Polygonal Subdivisions

In this article, we study automated simplification and schematization of territorial outlines. We present a quadratic-time simplification algorithm based on an operation called edge-move. We prove that the number of edges of any nonconvex simple polygon can be reduced with this operation. Moreover, edge-moves preserve area and topology and do not introduce new orientations. The latter property in particular makes the algorithm highly suitable for schematization in which all resulting lines are required to be parallel to one of a given set of lines (orientations). To obtain such a result, we need only to preprocess the input to use only lines that are parallel to one of the given set. We present an algorithm to enforce such orientation restrictions, again without changing area or topology. Experiments show that our algorithms obtain results of high visual quality.

[1]  Mohammad Ghodsi,et al.  Computing polygonal path simplification under area measures , 2012, Graph. Model..

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

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

[4]  Longin Jan Latecki,et al.  Schematizing Maps: Simplification of Geographic Shape by Discrete Curve Evolution , 2000, Spatial Cognition.

[5]  Esther M. Arkin,et al.  An efficiently computable metric for comparing polygonal shapes , 1991, SODA '90.

[6]  Bettina Speckmann,et al.  Topologically Safe Curved Schematisation , 2013 .

[7]  J. D. Whyatt,et al.  Line generalisation by repeated elimination of points , 1993 .

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

[9]  Serafino Cicerone,et al.  Fast and Simple Approach for Polygon Schematization , 2012, ICCSA.

[10]  Gabriele Neyer.  Line Simplification with Restricted Orientations , 1999, WADS.

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

[12]  Bettina Speckmann,et al.  Area-preserving approximations of polygonal paths , 2006, J. Discrete Algorithms.

[13]  Alexander Wolff,et al.  Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming , 2011, IEEE Transactions on Visualization and Computer Graphics.

[14]  Alexander Wolff,et al.  Drawing Metro Maps Using Bézier Curves , 2012, GD.

[15]  Martin Nöllenburg,et al.  On d-regular schematization of embedded paths , 2011, Comput. Geom..

[16]  A Reimer,et al.  Parallelity in chorematic territorial outlines , 2011 .

[17]  Mark de Berg,et al.  Schematization of networks , 2005, Comput. Geom..

[18]  A. Reimer,et al.  Understanding Chorematic Diagrams: Towards a Taxonomy , 2010 .

[19]  Bettina Speckmann,et al.  Area-Preserving Subdivision Schematization , 2010, GIScience.

[20]  J. Haunert.  A symmetry detector for map generalization and urban-space analysis , 2012 .

[21]  Jerry Swan,et al.  Automated Schematization for Web Service Applications , 2007, W2GIS.

[22]  Mark H. Overmars,et al.  Printed circuit board simplification: simplifying subdivisions in practice , 1995, SCG '95.

[23]  Maxwell J. Roberts.  Underground Maps Unravelled - Explorations in Information Design , 2012 .

[24]  Nabil H. Mustafa,et al.  Hardware-assisted view-dependent map simplification , 2001, SCG '01.

[25]  Miljenko Lapaine,et al.  Area Preserving Cartographic Line Generalizaton , 2009 .

[26]  Jan-Henrik Haunert,et al.  Map Schematization with Circular Arcs , 2014, GIScience.

[27]  Christopher B. Jones,et al.  Characterisation and generalisation of cartographic lines using Delaunay triangulation , 2002, Int. J. Geogr. Inf. Sci..

[28]  Martin Nöllenburg,et al.  Path Schematization for Route Sketches , 2010, SWAT.

[29]  Dömötör Pálvölgyi,et al.  Consistent digital line segments , 2010, SoCG '10.

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

[31]  Bettina Speckmann,et al.  A new method for subdivision simplification with applications to urban-area generalization , 2011, GIS.

[32]  Daniel R. Montello,et al.  Spatial Information Theory A Theoretical Basis for GIS , 1995, Lecture Notes in Computer Science.

[33]  Jan-Henrik Haunert,et al.  Accentuating focus maps via partial schematization , 2013, SIGSPATIAL/GIS.

[34]  Bettina Speckmann,et al.  Exploring Curved Schematization , 2014, 2014 IEEE Pacific Visualization Symposium.

[35]  Pietro Perona,et al.  Continuous dynamic time warping for translation-invariant curve alignment with applications to signature verification , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[36]  Andrés Marzal,et al.  Dynamic Time Warping of Cyclic Strings for Shape Matching , 2005, ICAPR.

[37]  Wouter Meulemans,et al.  Similarity measures and algorithms for cartographic schematization , 2014 .

[38]  M. Buchin.  On the Computability of the Frechet Distance Between Triangulated Surfaces , 2007 .

[39]  Mohammad Ghodsi,et al.  Computing homotopic line simplification , 2014, Comput. Geom..

[40]  Joachim Gudmundsson,et al.  Path Simplification for Metro Map Layout , 2006, Graph Drawing.

[41]  Barbara Tversky,et al.  Cognitive Maps, Cognitive Collages, and Spatial Mental Models , 1993, COSIT.

[42]  Bettina Speckmann,et al.  Area-Preserving C-Oriented Schematization ∗ , 2011 .