Geometric Similarity Measurement Method for Micro Scene Generalization

Geometric similarity plays an important role in geographic information retrieval, map matching, and data updating. Many approaches have been developed to calculate the similarity between simple features. However, complex group objects are common in map and spatial database systems. With a micro scene that contains different types of geographic features, calculating similarity is difficult. In addition, few studies have paid attention to the changes in a scene’s geometric similarity in the process of generalization. In this study, we developed a method for measuring the geometric similarity of micro scene generalization based on shape, direction, and position. We calculated shape similarity using the hybrid feature description, and we constructed a direction Voronoi diagram and a position graph to measure the direction similarity and position similarity. The experiments involved similarity calculation and quality evaluation to verify the usability and effectiveness of the proposed method. The experiments showed that this approach can be used to effectively measure the geometric similarity between micro scenes. Moreover, the proposed method accounts for the relationships amongst the geometrical shape, direction, and position of micro scenes during cartographic generalization. The simplification operation leads to obvious changes in position similarity, whereas delete and merge operations lead to changes in direction and position similarity. In the process of generalization, the river + islands scene changed mainly in shape and position, the similarity change in river + lakes occurred due to the direction and location, and the direction similarity of rivers + buildings and roads + buildings changed little.

Automatic Generalization of Residential Areas Based on “Paradigm” Theory and Big Data

“Paradigm” theory is an important ideological and practical tool for scientific research. The research means and methods of Geographic Information Science follow the laws of four paradigms. Automatic cartographic generalization is not only the key link of map making, but also a recognized difficult and hot issue. Based on large-scale map data and deep learning technology, an automatic cartographic generalization problem-solving model is proposed in this paper. According to the key and difficult problems faced by residential area selection and simplification, residential area selection models and simplification models based on big data and deep learning are constructed respectively, which provides new ideas and schemes to solve the key and difficult problems of residential area selection and simplification.

Design and Implementation of Real-time Power Grid WebGIS Visualization Framework Based on New Generation Dispatching and Control System

With the strengthening of the integrated characteristics of power grid and the construction of the New Generation Dispatching and Control System with “physical distribution, logical integration”, the demand for global monitoring and analysis of power grid has gradually increased. On the basis of understanding of design of the new generation real-time dispatching and control data platform system, with the principles of componentization and servitization, the real-time power grid WebGIS visualization framework is designed and implemented. And this paper further introduces the design of the front-end secondary development interface and examples, as well as the cartographic generalization of the power grid WebGIS visual map. This framework has successfully supported the construction and online operation of several real-time power grid WebGIS visualization applications.

TriangleConv: A Deep Point Convolutional Network for Recognizing Building Shapes in Map Space

The classification and recognition of the shapes of buildings in map space play an important role in spatial cognition, cartographic generalization, and map updating. As buildings in map space are often represented as the vector data, research was conducted to learn the feature representations of the buildings and recognize their shapes based on graph neural networks. Due to the principles of graph neural networks, it is necessary to construct a graph to represent the adjacency relationships between the points (i.e., the vertices of the polygons shaping the buildings), and extract a list of geometric features for each point. This paper proposes a deep point convolutional network to recognize building shapes, which executes the convolution directly on the points of the buildings without constructing the graphs and extracting the geometric features of the points. A new convolution operator named TriangleConv was designed to learn the feature representations of each point by aggregating the features of the point and the local triangle constructed by the point and its two adjacency points. The proposed method was evaluated and compared with related methods based on a dataset consisting of 5010 vector buildings. In terms of accuracy, macro-precision, macro-recall, and macro-F1, the results show that the proposed method has comparable performance with typical graph neural networks of GCN, GAT, and GraphSAGE, and point cloud neural networks of PointNet, PointNet++, and DGCNN in the task of recognizing and classifying building shapes in map space.

LCBRG: A lane-level road cluster mining algorithm with bidirectional region growing

Lane-level road cluster is a most representative phenomenon in road networks and is vital to spatial data mining, cartographic generalization, and data integration. In this article, a lane-level road cluster recognition method was proposed. First, the conception of lane-level road cluster and our motivation were addressed and the spatial characteristics were given. Second, a region growing cluster algorithm was defined to recognize lane-level road clusters, where constraints including distance and orientation were used. A novel moving distance (MD) metric was proposed to measure the distance of two lines, which can effectively handle the non-uniformly distributed vertexes, heterogeneous length, inharmonious spatial alignment, and complex shape. Experiments demonstrated that the proposed method can effectively recognize lane-level road clusters with the agreement to human spatial cognition.

A Novel Method for Building Displacement Based on Multipopulation Genetic Algorithm

Owing to map scale reduction and other cartographic generalization operations, spatial conflicts may occur between buildings and other features in automatic cartographic generalization. Displacement is an effective map generalization operation to resolve these spatial conflicts to guarantee map clarity and legibility. In this paper, a novel building displacement method based on multipopulation genetic algorithm (BDMPGA) is proposed to resolve spatial conflicts. This approach introduces multiple populations with different control parameters for simultaneous search optimization and adopts an immigration operation to connect different populations to realize coevolution. The optimal individuals of each population are selected and preserved in the elite population through manual selection operation to prevent the optimal individuals from being destroyed and lost in the evolutionary process. Meanwhile, the least preserving generation of the optimal individuals is used as the termination basis. To validate the proposed method, urban building data with a scale of 1:10,000 from Shenzhen, China are used. The experimental results indicate that the method proposed in this paper can effectively resolve spatial conflicts to obtain better results.