Method for expressing topological relation of polygonal scene

Abstract

The invention discloses a method for expressing a topological relation of a polygonal scene. The method is used for expressing a topological structure of the polygonal scene. The method comprises the following steps of A, performing topological homeomorphism transformation on the polygonal scene and generating a topological homeomorphism graph; B, generating a dual graph for the topological homeomorphism graph generated in the step A, and then extracting a neighborhood relation between polygons in the dual graph; and C, establishing a polygonal shape set according to the neighborhood relation between the polygons obtained in the step B, performing sorting on the polygons by adopting k-order neighbor, and generating k-order neighbor coded character strings of the polygons to express the topological structure of the polygonal scene. According to the method for expressing the topological relation of the polygonal scene, provided by the invention, the topological relation of the polygonal scene can be expressed by using simple character strings, so that the efficiency of judging topological homeomorphism of the polygonal scene is improved.

Description

technical field [0001] The invention relates to an algorithm for expressing and judging a space scene, in particular to a method for expressing the topological relationship of a polygonal scene. Background technique [0002] A spatial scene includes a set of spatial objects and their spatial layout. It has a wide range of applications in GIS, spatial cognition, textile, architectural design and other fields. In GIS, the query and reasoning of spatial scenes are the extension of traditional SQL-based spatial query, which is also a hot spot in GIS research in recent years (Egenhofer, 1994; Clare, 2000; Nedas et al, 2008). The core problem of spatial scene query in GIS is the comparison of topological consistency of spatial scene. The difficulty lies in how to determine the mapping relationship between the query scene and the object and its spatial relationship in the database dataset. In response to this academic problem, Egenhofer et al. (1994) added dimension, intersection...

AI Technical Summary

Problems solved by technology

Although the existing connection graph can express the network relationship of polygonal scenes, it is not conducive to the expression and cognition of the overall layout of the topological relationship of polygonal scenes. Using a recursive algorithm to judge the topological equality of polygonal scenes requires the establishment of different polygons. The mapping relationship between individual polygons in the scene, the calculation efficiency is not high

Images