Font Size: a A A

Research On Algorithms For Computing Spatial Topological Relations

Posted on:2012-07-29Degree:MasterType:Thesis
Country:ChinaCandidate:X M SunFull Text:PDF
GTID:2210330338974188Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Along with the development of GIS application, more and more the spatial analysis is demanded. As one of spatial relations, spatial topological relation refers to topological invariant of topological transformation (translation, rotation, scaling and so on). Topological relation is cardinal significant and has a number of practical applications in areas such as spatial data modeling, spatial query, analysis, inference, cartographic generalization, update of spatial data, image retrieval, similarity analysis and so on. This paper researches on the algorithms for computing spatial topological relations, and some innovative contributions are achieved as follows:1,Do research on spatial inclusion relation, propose algorithms for computing inclusion relation between spatial objects and propose algorithm RIRC-QR for computing region inclusion relations based on QR-tree index. The algorithm builds a QR-tree index according to the information of spatial objects and then queries all spatial objects included by the region on the QR-tree. Algorithm RIRC-QR is applied to spatial clustering in GML data based on line-region inclusion relations. The experimental results show that algorithm RIRC-QR is effective and efficient.2,Do research on spatial intersection relation, propose algorithms for computing intersection relation between spatial objects and mainly introduce the computing of two segments, segment and region,segment and body in 3D space.3,Do research on spatial adjacent relation and propose algorithms for computing adjacent relation between spatial objects. Algorithms CRAR and CRAR-DF are proposed for computing region adjacent relations in 3D space in this paper. Region objects and other spatial objects are adjacent if the distance of them is less than threshold value. Based on CRAR, CRAR-DF judges adjacent relations rapidly according to distance function. The experimental results show that algorithms CRAR and CRAR-DF are effective and CRAR-DF is more efficient.
Keywords/Search Tags:spatial topological relations, inclusion relation, intersection relation, adjacent relation
PDF Full Text Request
Related items