Share Email Print

### Proceedings Paper

Queries of nature neighbor objects on UnitsDelaunay structure in spatial database
Author(s): Jiatian Li; Renliang Zhao; Jun Chen
Format Member Price Non-Member Price
PDF \$14.40 \$18.00

Paper Abstract

In recent years, the research on models of spatial relation computation can be divided into two types: the spatial relation among intersected entities and the spatial relation among the non-intersected entities. Currently, the latter is often used distance, direction and coordinate systems and other methods to study. But these quantitative methods are difficult to sympathize with human natural language understanding and space cognitive habits. Nature neighbor relationship is a vital space relationship. It can answer such questions as "Which hospital are adjacent to the moving object?" "Which schools are adjacent to the McDonald's shop?" In this paper, we analyzed two methods to compute the nature neighbor relationships: Voronoi diagram method and Delaunay triangulation method. We found the main problems for applying these methods to spatial selection are the overall and repetitive calculation. In some basic theory: (i) Define function f in order to distinct different types of triangle. According to the different sources of the nodes, the f is individually equal to 0, 1 and 2. And then the 3×3 matrix C is built on the f. According to the different values of |C|, we can divide the triangles as three types: α, β, γ. (ii) Taking into account that the triangles of type α is not entirely internal concave polygon, we divide the type α into type α and δ on the condition whether the polygon includes the focus of the triangle or not. Then the D(P) composed by Q includes four types of triangles: α, β, γ and δ. (iii) Demonstrate that the space scope of Q in R2 is equal to the space scope of triangle set T of type α in D(P) , reasoned out the complement of Q in R2 is equivalence with the set {Tβ union Tγ union Tδ} and the nature neighbor relationship can only exist in the set {Tβ union Tγ union Tδ}. (iv) For β and γ-type triangle we posed a subset of their sources and demonstrated the certainty in the context of natural subset of the space adjacent to the existing relationship, and regarded the space scope of every subset as a Unit, defined the structure of UnitsDelaunay and proposed the construction algorithm of the UnitsDelaunay. For the Quad GridFile: (i) Respectively approximated the Units composed of β and γ-type triangles by two methods of MBR of MCR and MBR. (ii) Demonstrated the completeness of the closure of the result set of point querying. (iii) Taking into account the update of GridFile, we proposed the Quad GridFile index structure, i.e. the structure added into quad tree spatial partition, replacing the update of structure by the reconstruction of GridFile structure, which the space scope of GridFile is represented by every leaf node. We utilized the extraction of candidate set of point spatial selection and self-join spatial selection as the instances. In the environment of Oracle 9.2.1 and Eclipse 3.1, we accomplished the proposed structures and related algorithm. Finally, we gave illustrations of the experimental results.

Paper Details

Date Published: 28 October 2006
PDF: 15 pages
Proc. SPIE 6420, Geoinformatics 2006: Geospatial Information Science, 642004 (28 October 2006); doi: 10.1117/12.712618
Show Author Affiliations
Jiatian Li, China Univ. of Mining & Technology (China)
National Geomatics Ctr. of China (China)
Renliang Zhao, National Geomatics Ctr. of China (China)
Jun Chen, National Geomatics Ctr. of China (China)

Published in SPIE Proceedings Vol. 6420:
Geoinformatics 2006: Geospatial Information Science
Jianya Gong; Jingxiong Zhang, Editor(s)