An effective method for calculating natural adjacency relation in spatial database

Authors:
Renliang Zhao;Jiatian Li
Affiliations:
National Geometrics Center of China, Beijing, China;National Geometrics Center of China, Beijing, China and School of Resources and Safety Engineering, CMUT, Beijing, China
Venue:
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Year:
2007

Citing 4
Cited 0

Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
On deletion in Delaunay triangulations

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Data mining: concepts and techniques

Data mining: concepts and techniques
Delete and insert operations in Voronoi/Delaunay methods and applications

Computers & Geosciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper explores the way in which natural adjacency relation, spatial database are closely integrated through the spatial index for spatial data querying and mining. A Delaunay triangulation approach for constructing spatial index is proposed, which overcomes the conflict between line-intersection computation and natural adjacency isn't satisfying constrained condition of Euclidean distance. Based on this approach, a spatial index prototype for discrete areal objects-Quad GridFile is designed and implemented by using Java extending Oracle Spatial. It demonstrates foundational information extraction ability for geospatial database.