Geographic features in maps consist of a mixture of points, polylines, and polygons, generally including POIs, roads, buildings, and other geographic features. Due to the differing dimensionality of these various types of geographic data, traditional geometric similarity measurement methods that rely on a single type of feature are not applicable to mixed scenes. The traditional solution to this issue is to treat points as projections of polylines and polylines as projections of polygons. Through neural networks, projection matrices can be learned to convert points, polylines, and polygons into the same type of object, thereby enabling the use of single-scene geometric measurement methods (e.g., Graph Neural Networks) to solve the problem. However, the key challenge in using Graph Neural Networks for similarity measurement is learning the adjacency relationships between geometric features. It is evident that the adjacency relationships between different feature pairs, such as polyline–polygon, polyline–polyline, and polygon–polygon, require different approaches for measurement, and these diverse relationships cannot be captured by a simple GNN. Heterogeneous Graph Neural Networks (HGNNs) are suited to address this problem: different adjacency relationships between feature pairs can be learned using distinct embedded networks, the new node characteristics can be calculated through the information aggregation and propagation framework of HGNNs, and these new characteristics can be used for geometric similarity measurement. Finally, the effectiveness of the proposed method was verified through practical experiments.
One of the goals of map generalization is to achieve real-time visualization of massive entities while adapting to zoom-in/zoom-out conditions. Unlike traditional map generalization, this type of scaling operation does not simplify the data to produce a final result; it only outputs temporary visualization data. To meet the current visualization scale requirements, we insert a simplification algorithm prior to visualization to process the data. Taking point simplification as an example, this study proposes a novel massive point selection method and optimizes the entire algorithmic process, enabling the method to quickly and efficiently handle point selection for datasets ranging from tens of thousands to millions of points. The method employs a geometric construction, namely a Delaunay triangulation, is applied to discover the distribution characteristics with real-time efficiency. Initially, we construct the Delaunay triangulation of the point cluster. Subsequently, we calculate the mean distance of each point as the selection feature. Finally, we incorporate a ‘fixed point’ concept to rank and stabilize the points during the selection process. Experimental results indicate that our method not only achieves commendable performance in considering spatial structure, comparable to both traditional and state-of-the-art methods but also demonstrates significantly higher efficiency. This method can efficiently handle point selection for datasets ranging from tens of thousands to millions of points in a short time, thereby greatly enhancing the practicality of the algorithm in complex point selection scenarios.