Contour line simplification method based on the two‐level Bellman–Ford algorithm

The contour line is one of the basic elements of a topographic map. Existing contour line simplification methods are generally applied to maps without topological errors. However, contour lines acquired from a digital elevation model (DEM) may contain topological errors before simplification. Targeted at contour lines with topological errors, a progressive simplification method based on the two‐level Bellman–Ford algorithm is proposed in this study. Simplified contour lines and elevation error bands were extracted from the DEM. The contour lines of the elevation error bands were initially simplified with the Bellman–Ford (BF) algorithm. The contour lines were then segmented using the vertices of the initial simplification result and connected curves with the same bending direction were merged into a new curve. Subsequently, various directed graphs of the merged curves were constructed and a second simplification was made using the BF algorithm. Finally, the simplification result was selected based on the similarity between several simplification results and adjacent contour lines. The experimental results indicate that the main shapes of the contour groups can be maintained with this method and original topological errors are resolved.

[1]  Wei Wu,et al.  A Reconstruction Method for Broken Contour Lines Based on Similar Contours , 2018, ISPRS Int. J. Geo Inf..

[2]  Lu Wang,et al.  A new approach to simplifying polygonal and linear features using superpixel segmentation , 2018, Int. J. Geogr. Inf. Sci..

[3]  Francisco Javier Ariza-López,et al.  DEMs: An Approach to Users and Uses from the Quality Perspective , 2018, Int. J. Spatial Data Infrastructures Res..

[4]  Jie Li,et al.  DEM generation from contours and a low-resolution DEM , 2017 .

[5]  Timofey E. Samsonov,et al.  Shape-adaptive geometric simplification of heterogeneous line datasets , 2017, Int. J. Geogr. Inf. Sci..

[6]  Jingzhong Li,et al.  Envelope generation and simplification of polylines using Delaunay triangulation , 2017, Int. J. Geogr. Inf. Sci..

[7]  Fang Wu,et al.  A New Simplification Approach Based on the Oblique-Dividing-Curve Method for Contour Lines , 2016, ISPRS Int. J. Geo Inf..

[8]  Bettina Speckmann,et al.  Area-Preserving Simplification and Schematization of Polygonal Subdivisions , 2016, ACM Trans. Spatial Algorithms Syst..

[9]  Giuseppe Pelagatti,et al.  Snap Rounding with Restore , 2016, ACM Trans. Spatial Algorithms Syst..

[10]  Türkay Gökgöz,et al.  A New Algorithm for Cartographic Simplification of Streams and Lakes Using Deviation Angles and Error Bands , 2015, ISPRS Int. J. Geo Inf..

[11]  Tinghua Ai,et al.  Area‐preservation Simplification of Polygonal Boundaries by the Use of the Structured Total Least Squares Method with Constraints , 2015, Trans. GIS.

[12]  Francisco Javier Ariza-López,et al.  A Method of Positional Quality Control Testing for 2D and 3D Line Strings , 2015, Trans. GIS.

[13]  Wenli Li,et al.  An Efficient and Topologically Correct Map Generalization Heuristic , 2015, ICEIS.

[14]  T. Ai,et al.  A Simplification of Ria Coastline with Geomorphologic Characteristics Preserved , 2014 .

[15]  Paulo Raposo.  Scale-specific automated line simplification by vertex clustering on a hexagonal tessellation , 2013 .

[16]  Morten Revsbæk,et al.  Simplifying Massive Contour Maps , 2012, ESA.

[17]  David Eppstein,et al.  Randomized Speedup of the Bellman-Ford Algorithm , 2011, ANALCO.

[18]  J. F. Reinoso.  An algorithm for automatically computing the horizontal shift between homologous contours from DTMs , 2011 .

[19]  P. S. Hiremath,et al.  Generating contour lines using different elevation data file formats , 2011, ArXiv.

[20]  Lixin Zhang,et al.  Efficient Simplification of Large Vector Maps Rendered onto 3D Landscapes , 2011, IEEE Computer Graphics and Applications.

[21]  J. F. Reinoso,et al.  A priori horizontal displacement (HD) estimation of hydrological features when versioned DEMs are used , 2010 .

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

[23]  Francisco José Madrid-Cuevas,et al.  Contour simplification using a multi-scale local phase analysis , 2008, Image Vis. Comput..

[24]  Tinghua Ai,et al.  The drainage network extraction from contour lines for contour line generalization , 2007 .

[25]  Nabil H. Mustafa,et al.  Dynamic simplification and visualization of large maps , 2006, Int. J. Geogr. Inf. Sci..

[26]  Türkay Gökgöz,et al.  Generalization of Contours Using Deviation Angles and Error Bands , 2005 .

[27]  Shin-Ting Wu,et al.  The Douglas-Peucker Algorithm: Sufficiency Conditions for Non-Self-Intersections , 2004, J. Braz. Comput. Soc..

[28]  Haigang Sui,et al.  An Integrated Technique for Automated Generalization of Contour Maps , 2000 .

[29]  Stan Openshaw,et al.  Algorithms for automated line generalization1 based on a natural principle of objective generalization , 1992, Int. J. Geogr. Inf. Sci..

[30]  Byron Nakos,et al.  A methodology on natural occurring lines segmentation and generalization , 2008 .

[31]  R. Huber,et al.  AUTOMATIC DERIVATION OF GENERALIZED CONTOUR LINES FOR TOPOGRAPHIC MAPS USING HIGH-RESOLUTION AIRBORNE INTERFEROMETRIC RADAR DATA , 2007 .

[32]  Xiaopeng Li,et al.  AUTOMATIC CONTOUR LINE GENERATION USING INTERMAP'S DIGITAL TERRAIN MODEL , 2006 .

[33]  Türkay Gökgöz,et al.  A New Approach for the Simplification of Contours , 2004, Cartogr. Int. J. Geogr. Inf. Geovisualization.

[34]  T. Ai.  A GENERALIZATION OF CONTOUR LINE BASED ON THE EXTRACTION AND ANALYSIS OF DRAINAGE SYSTEM , 2004 .

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

[36]  G. Dutton.  Scale, Sinuosity, and Point Selection in Digital Line Generalization , 1999 .

[37]  Jean-Claude Müller,et al.  Line Generalization Based on Analysis of Shape Characteristics , 1998 .

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