A New Simplification Approach Based on the Oblique-Dividing-Curve Method for Contour Lines

As one of the key operators of automated map generalization, algorithms for the line simplification have been widely researched in the past decades. Although many of the currently available algorithms have revealed satisfactory simplification performances with certain data types and selected test areas, it still remains a challenging task to solve the problems of (a) how to properly divide a cartographic line when it is too long to be dealt with directly; and (b) how to make adaptable parameterizations for various geo-data in different areas. In order to solve these two problems, a new line-simplification approach based on the Oblique-Dividing-Curve (ODC) method has been proposed in this paper. In this proposed model, one cartographic line is divided into a series of monotonic curves by the ODC method. Then, the curves are categorized into different groups according to their shapes, sizes and other geometric characteristics. The curves in different groups will trigger different strategies as well as the associated criteria for line simplification. Whenever a curve is simplified, the whole simplified cartographic line will be re-divided and the simplification process restarts again, i.e., the proposed simplification approach is iteratively operated until the final simplification result is achieved. Experiment evidence demonstrates that the proposed approach is able to handle the holistic bend-trend of the whole cartographic line during the simplification process and thereby provides considerably improved simplification performance with respect to maintaining the essential shape/salient characteristics and keeping the topological consistency. Moreover, the produced simplification results are not sensitive to the parameterizations of the proposed approach.

[1]  Stefano Spaccapietra,et al.  Modelling geographic data with multiple representations , 2004, Int. J. Geogr. Inf. Sci..

[2]  Woo-Jin Park,et al.  GENERALIZATION OF DIGITAL TOPOGRAPHIC MAP USING HYBRID LINE SIMPLIFICATION , 2010 .

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

[4]  Alexander Wolff,et al.  Morphing polylines: A step towards continuous generalization , 2008, Comput. Environ. Urban Syst..

[5]  B. Jiang,et al.  Line Simplification , 2014 .

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

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

[8]  Jon G. Rokne,et al.  Robustness in GIS algorithm implementation with application to line simplification , 2001, Int. J. Geogr. Inf. Sci..

[9]  Corinne Plazanet Measurement , Characterization and Classification for Automated Line Feature Generalization , 1995 .

[10]  Sébastien Mustière,et al.  A TRANSITION FROM SIMPLIFICATION TO GENERALISATION OF NATURAL OCCURRING LINES , 2008 .

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

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

[13]  L. Hurni,et al.  A progressive line simplification algorithm , 2002 .

[14]  Sheng Zhou,et al.  Shape-Aware Line Generalisation With Weighted Effective Area , 2004, SDH.

[15]  D. D. Hoffman,et al.  Representing Smooth Plane Curves for Recognition: Implications for Figure-Ground Reversal , 1982, AAAI.

[16]  Wen Liu,et al.  Research on Vessel Trajectory Multi-Dimensional Compression Algorithm Based on Douglas-Peucker Theory , 2014 .

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

[18]  Wenzhong Shi,et al.  Performance Evaluation of Line Simplification Algorithms for Vector Generalization , 2006 .

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

[20]  F. Töpfer,et al.  The Principles of Selection , 1966 .

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

[22]  Emmanuel Fritsch,et al.  The Importance of Geometric Modeling in Linear Feature Generalization , 1995 .

[23]  Mariane Alves Dal Santo,et al.  Algorithms for Automated Line Generalization in GIS , 2008 .

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