Search

Maintaining topological consistency is a crucial issue for 3D cadastral modeling as this helps to represent the cadastral boundary clearly and accurately. As a result, 3D cadastral data models are mainly built on the basis of topological models that allow topology to be expressed clearly. However, topological models in Euclidean space cannot directly represent objects’ geometric information. As geometric information is important in 3D spatial analysis, 3D cadastral data models based on topological models cannot realize topological calculation and analysis. Previous research has proved that geometric and topological information for cadastral objects can be integrated and represented by conformal geometric algebra (CGA) expressions. This paper aims to realize 3D topological analysis in the cadastral field using CGA’s advantages in geometric relations computation. A calculation framework is designed on the basis of the outer product to achieve the purpose of multidimensional unity for 3D cadastral topological analysis in this paper. A calculation framework of topological relations between a boundary point (or a boundary line) and a cadastral parcel is developed. A total of 13 types of topological relations between a boundary point and a cadastral parcel and 48 types of topological relations between a boundary line and a cadastral parcel are obtained. The study indicates that the advantages of CGA in multidimensional unified representation and calculation can be used to solve problems encountered by topological models in Euclidean space.

Polygonal data often require rendering with symbolization and simplification in geovisualization. A common issue in existing methods is that simplification, symbolization and rendering are addressed separately, causing computational and data redundancies that reduce efficiency, especially when handling large complex polygonal data. Here, we present an efficient polygonal data visualization method by organizing the simplification, tessellation and rendering operations into a single mesh generalization process. First, based on the sweep line method, we propose a topology embedded trapezoidal mesh data structure to organize the tessellated polygons. Second, we introduce horizontal and vertical generalization operations to simplify the trapezoidal meshes. Finally, we define a heuristic testing algorithm to efficiently preserve the topological consistency. The method is tested using three OpenStreetMap datasets and compared with the Douglas Peucker algorithm and the Binary Line Generalization tree-based method. The results show that the proposed method improves the rendering efficiency by a factor of six. Efficiency-sensitive mapping applications such as emergency mapping could benefit from this method, which would significantly improve their visualization performances.