Next Article in Journal
Machine Learning for Gully Feature Extraction Based on a Pan-Sharpened Multispectral Image: Multiclass vs. Binary Approach
Next Article in Special Issue
Spatiotemporal Variation of NDVI in the Vegetation Growing Season in the Source Region of the Yellow River, China
Previous Article in Journal
A Method for Generating Variable-Scale Maps for Small Displays
Previous Article in Special Issue
A Multi-Scale Water Extraction Convolutional Neural Network (MWEN) Method for GaoFen-1 Remote Sensing Images
Open AccessArticle

A Vector Line Simplification Algorithm Based on the Douglas–Peucker Algorithm, Monotonic Chains and Dichotomy

1
Faculty of Geomatics, East China University of Technology, 418# Guanglan Road, Nanchang 330013, China
2
Department of Geography, Center for Human Dynamics in the Mobile Age (HDMA), San Diego State University, 5500 Campanile Drive, San Diego, CA 92182-4493, USA
3
State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, 129# Luoyu Road, Wuhan 430079, China
*
Authors to whom correspondence should be addressed.
ISPRS Int. J. Geo-Inf. 2020, 9(4), 251; https://doi.org/10.3390/ijgi9040251
Received: 11 March 2020 / Revised: 31 March 2020 / Accepted: 16 April 2020 / Published: 17 April 2020
When using the traditional Douglas–Peucker (D–P) algorithm to simplify linear objects, it is easy to generate results containing self-intersecting errors, thus affecting the application of the D–P algorithm. To solve the problem of self-intersection, a new vector line simplification algorithm based on the D–P algorithm, monotonic chains and dichotomy, is proposed in this paper. First, the traditional D–P algorithm is used to simplify the original lines, and then the simplified lines are divided into several monotonic chains. Second, the dichotomy is used to search the intersection positions of monotonic chains effectively, and intersecting monotonic chains are processed, thus solving the self-intersection problems. Two groups of experimental data are selected based on large data sets. Results demonstrate that the proposed experimental method has advantages in algorithmic efficiency and accuracy when compared to the D–P algorithm and the Star-shaped algorithm. View Full-Text
Keywords: Line Simplification; Douglas-Peucker Algorithm; Monotonic Chain; Dichotomy Line Simplification; Douglas-Peucker Algorithm; Monotonic Chain; Dichotomy
Show Figures

Figure 1

MDPI and ACS Style

Liu, B.; Liu, X.; Li, D.; Shi, Y.; Fernandez, G.; Wang, Y. A Vector Line Simplification Algorithm Based on the Douglas–Peucker Algorithm, Monotonic Chains and Dichotomy. ISPRS Int. J. Geo-Inf. 2020, 9, 251.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop