Simplification method and apparatus for road network

Abstract

The present invention provides a simplification method and apparatus for a road network. The method comprises: partitioning a to-be-simplified road network into a plurality of to-be-simplified paths, and acquiring a path sequence of the to-be-simplified paths, wherein the path sequence is a sequence which is obtained according to a preset rule and contains each point om the to-be-simplified paths; searching for supporting points in the path sequence to obtain a supporting point sequence of the to-be-simplified paths; and determining a simplification path according to starting points of the to-be-simplified paths, the supporting point sequence and end points of the to-be-simplified paths so as to realize simplification on the to-be-simplified road network. The above method can keep a geometry topology relationship between the points, and effectively reflects path distribution.

Description

technical field [0001] The invention relates to the field of data processing, in particular to a method and device for simplifying a road network. Background technique [0002] In the application of Geographic Information System (GIS for short) on large-scale road networks, the road information is intricate. Although the path of interest can be screened out after region clipping, there may still be a large number of road segments in the clipping area, which increases the Reduced processing overhead and data storage space. In the prior art, the least squares method is often used to simplify the road network by fitting straight lines to discrete points. However, because the roads in the electronic map use real geographic coordinates with large values, the coefficient matrix shows a large difference in eigenvalues. In a large situation, and the geometric topological relationship between points cannot be maintained, it cannot reflect the original distribution of the road networ...

AI Technical Summary

Problems solved by technology

[0002] In the application of Geographic Information System (GIS for short) on large-scale road networks, the road information is intricate. Although the path of interest can be screened out after region clipping, there may still be a large number of road segments in the clipping area, which increases the processing overhead and data storage space

In the prior art, the least squares method is often used to simplify the road network by fitting straight lines to discrete points. However, because the roads in the electronic map use real geographic coordinates with large values, the coefficient matrix shows a large difference in eigenvalues. In large cases, and the geometric topological relationship between points cannot be maintained, it cannot reflect the original distribution of the road network

Images