Metrics 0

Export Article

Open AccessArticle
ISPRS Int. J. Geo-Inf. 2019, 8(3), 105; https://doi.org/10.3390/ijgi8030105

An Algorithm based on the Weighted Network Voronoi Diagram for Point Cluster Simplification

1,2
,
1,2,*
,
3
,
1,2
and
1
Faculty of Geomatics, Lanzhou Jiaotong University, Lanzhou 730070, China
2
Gansu Provincial Engineering Laboratory for National Geographic State Monitoring, Lanzhou 730070, China
3
School of Resource and Environmental Sciences, Wuhan University, Wuhan 430079, China
4
Faculty of Geomatics; Information Engineering University, Zhengzhou 450000, China
*
Author to whom correspondence should be addressed.
Received: 4 January 2019 / Revised: 10 February 2019 / Accepted: 23 February 2019 / Published: 27 February 2019
|   PDF [8140 KB, uploaded 27 February 2019]   |

Abstract

Points on maps that stand for geographic objects such as settlements are generally connected by road networks. However, in the existing algorithms for point cluster simplification, points are usually viewed as discrete objects or their distances are considered in Euclidean spaces, and therefore the point cluster generalization results obtained by these algorithms are sometimes unreasonable. To take roads into consideration so that point clusters can be simplified in appropriate ways, the network Voronoi diagram is used and a new algorithm is proposed in this paper. First, the weighted network Voronoi diagram is constructed taking into account the weights of the points and the properties of the related road segments. Second, the network Voronoi polygons are generated and two factors (i.e., the area of the network Voronoi polygon and the total length of the dilated road segments in the polygon) are considered as the basis for point simplification. Last, a Cartesian coordinate system is built based on the two factors and the point clusters are simplified by means of the “concentric quadrants”. Our experiments show that the algorithm can effectively and correctly transmit types of information in the process of point cluster simplification, and the results are more reasonable than that generated by the ordinary Voronoi-based algorithm and the weighted Voronoi-based algorithm. View Full-Text
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

MDPI and ACS Style

Lu, X.; Yan, H.; Li, W.; Li, X.; Wu, F. An Algorithm based on the Weighted Network Voronoi Diagram for Point Cluster Simplification. ISPRS Int. J. Geo-Inf. 2019, 8, 105.

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

1