Simultaneous & topologically-safe line simplification for a variable-scale planar partition

We employ a batch generalization process for obtaining a variable- scale planar partition. We describe an algorithm to simplify the boundary lines after a map generalization operation (either a merge or a split operation) has been applied on a polygonal area and its neighbours. The simplification is performed simultaneously on the resulting boundaries of the new polygonal areas that replace the areas that were processed. As the simplification strategy has to keep the planar partition valid, we define what we consider to be a valid planar partition (among other requirements, no zero-sized areas and no unwanted intersections in the boundary polylines). Furthermore, we analyse the effects of the line simplification for the content of the data structures in which the planar partition is stored.

[1]  A. Saalfeld.  Topologically Consistent Line Simplification with the Douglas-Peucker Algorithm , 1999 .

[2]  G.A.K. Arroyo Ohori.  Validation and Automatic Repair of Planar Partitions using a Constrained Triangulation , 2012 .

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

[4]  Peter van Oosterom,et al.  Reactive Data Structures for Geographic Information Systems , 1993 .

[5]  Thomas K. Peucker,et al.  2. Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or its Caricature , 2011 .

[6]  Hugo Ledoux,et al.  Validation of planar partitions using constrained triangulations , 2010 .

[7]  Lutz Plümer,et al.  Achieving Integrity in Geographic Information Systems—Maps and Nested Maps , 1997, GeoInformatica.

[8]  Leonidas J. Guibas,et al.  A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

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

[10]  Shin-Ting Wu,et al.  A Robust Strategy for Handling Linear Features in Topologically Consistent Polyline Simplification , 2006, GeoInfo.

[11]  Peter van Oosterom,et al.  A Storage and Transfer Efficient Data Structure for Variable Scale Vector Data , 2009, AGILE Conf..

[12]  Lutz Plümer,et al.  Provably correct and complete transaction rules for GIS , 1997, GIS '97.

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

[14]  Christopher Dyken,et al.  Simultaneous curve simplification , 2009, J. Geogr. Syst..

[15]  Jon Louis Bentley,et al.  K-d trees for semidynamic point sets , 1990, SCG '90.

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

[17]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..

[18]  P. V. Oosterom.  Variable-scale Topological Data Structures Suitable for Progressive Data Transfer: The GAP- face Tree and GAP-edge Forest , 2005 .

[19]  Max J. Egenhofer,et al.  Ontology-driven map generalization , 2005, J. Vis. Lang. Comput..