A event-based change detection method of cadastral database incremental updating.
ABSTRACT Event information reflects reasons for cadastral entities changes, and constitutes incremental information together with changing information. However, the existing change detection methods of incremental updating haven’t realized the event information detection so far. To address this issue, taking parcels as an example, a new change detection method including event semantics is proposed and used in cadastral database incremental updating. In the method, parcel event knowledge rule database is established through selecting the three factors inheritance relationship, topology relationship and attribute relationship as prerequisites. On the basis of detecting changing information, the event information is deduced by calculating different values of the above factors according to the established parcel event knowledge rules. A prototype system is designed and realized, and its experimental results show that the method can accurately deduce the changing information of parcels and their corresponding event information. In addition, the detection method also provides a solution for realizing the automation of cadastral database incremental updating.
Article: Comparing two sets of polygons.[show abstract] [hide abstract]
ABSTRACT: In this article, a new algorithm for determining differences between two sets of polygons is considered. It has been proven that it is enough to test only the polygon edges to perform the comparison. The algorithm works in two steps. First, the polygon edges are initialised into a data structure and equal edges are eliminated by a simple criterion. In the second part, the algorithm analyses the remaining edges and prepares a report about the detected differences. To speed-up the geometric search, the algorithm uses a combination of a uniform space subdivision and binary searching trees. It has been shown that the algorithm is numerically stable, and works well with a limited set of non-simple polygons from a land cadastre. The algorithm's time complexity is O (n log n), and space complexity O(n), where n is the common number of edges in both sets of polygons. This is been confirmed by experiments using data sets from the land cadastre.International Journal of Geographical Information Science. 01/2003; 17:431-443.
- [show abstract] [hide abstract]
ABSTRACT: Based on the relationship among the geographic events, spatial changes and the database operations, a new automatic (semi-automatic) incremental updating approach of spatio-temporal database (STDB) named as event-based incremental updating (E-BIU) is proposed in this paper. At first, the relationship among the events, spatial changes and the database operations is analyzed, then a total architecture of E-BIU implementation is designed, which includes an event queue, three managers and two sets of rules, each component is presented in detail. The process of the E-BIU of master STDB is described successively. An example of building’s incremental updating is given to illustrate this approach at the end. The result shows that E-BIU is an efficient automatic updating approach for master STDB.Journal of Central South University of Technology 01/2004; 11(2):192-198. · 0.36 Impact Factor
- [show abstract] [hide abstract]
ABSTRACT: This paper describes a prototype software application, modeling the locational relationships of cadastral objects as understood by a cadastral cartographer tasked with compiling and updating the land ownership parcel map.Cadastral cartographers have a practical problem: in implementing their conceptual model of the land parcel map, it is preferable that location updates be made in the same order in which they arrive to be recorded. However, current technology requires that more spatially accurate surveys are entered into the database before less accurate ones are fitted to them––and contemporary surveys are typically more accurate than ancient or moderately old ones. Hence, updating a cadastral database for location entails reconstructing it a section at a time, entering surveys (in general) in reverse date order.A strategy is presented that allows updating of location in date-forward order. The strategy is based on capturing locational relationships and measurements extracted from plats and deed descriptions, so that when an object's location is updated, it sends a message to objects for which it is a spatial reference to update their own locations.Computers, Environment and Urban Systems. 01/2004; 28:511-529.