| Popis: |
The aggregation of buildings is generally based on the disjoint in spatial topological relationships. However, with the diversification of data sources, the spatial topological relationships between polygons inside large buildings also become diversified and even inconsistent, making it difficult to aggregate building polygons, while the multi-scale visualization of buildings in the smart city requires rapid and accurate extraction of the contour shapes of complex buildings. For this reason, this paper proposes an aggregation method of buildings based on the shortest adjacent line between vertexes interpolated. First, recursively search for adjacent polygons based on the aggregation distance to determine the clustering regions, which is convenient for processing the map data in every region. Then, for each clustered region, encrypt vertices for each polygon using a linear interpolation method according to the order of the points on it; after that, search and construct the shortest adjacent line between each vertice and the adjacent polygon through the grid index, and delete the three types of shortest adjacent lines which are abnormal; then, merge the effective shortest adjacent lines in a certain order to form the shortest adjacent line group, and further filter out three kinds of special cases, so as to determine the aggregation area of adjacent polygons; finally, the recursive search is performed clockwise according to the minimum rotation angle, and the contour of polygons including the inner ring and the outer ring is extracted. Experiments show that this method can quickly detect the aggregation area between the adjacent polygons. Experiments in this paper show that this method can quickly detect the adjacent aggregation areas between building polygons and accurately extract the outer contour lines of complex building entities in real-time. The overall contours extracted are close to the actual situation, which provides conditions for building visualization. |
