An Effective Method For Calculating Natural Adjacency Relation in Spatial Database

  title={An Effective Method For Calculating Natural Adjacency Relation in Spatial Database},
  author={R. Zhao and Jiatian Li},
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… Expand
1 Citations
Advances in Knowledge Discovery and Data Mining
This two-volume set, LNAI 9077 + 9078, constitutes the refereed proceedings of the 19th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2015, held in Ho Chi MinhExpand


Voronoi-based k-order neighbour relations for spatial analysis
In this paper, the concept of k-order neighbours is developed and a Voronoi-based model is formed for this type of neighbours, resulting in the so-called Vor onoi k- order neighbours. Expand
Data structures and algorithms to support interactive spatial analysis using dynamic Voronoi diagrams
To support the need for interactive spatial analysis, it is often necessary to rethink the data structures and algorithms underpinning applications. This paper describes the development of anExpand
On Deletion in Delaunay Triangulations
  • O. Devillers
  • Mathematics, Computer Science
  • Int. J. Comput. Geom. Appl.
  • 2002
The space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently and Heller algorithm, a variation of Heller's algorithm, which is popular in the geographic information system community is false. Expand
Problems with handling spatial data ― the Voronoi approach
Experience with the handling of spatial data on a computer led to the identification of a variety of “awkward” problems, including interpolation, error estimation and dynamic polygon building and e...
Delete and insert operations in Voronoi/Delaunay methods and applications
This paper presents simple point insertion and deletion operations in Voronoi diagrams and Delaunay triangulations which may be useful for a wide variety of applications, either where interactivityExpand
Spatial Tessellations: Concepts and Applications of Voronoi Diagrams
This paper presents generalizations of the Voronoi Diagrams, a model of Spatial Interpolation, and some of the algorithms used in this study to derive these generalizations. Expand
Data Mining: Concepts and Techniques
This book presents dozens of algorithms and implementation examples, all in pseudo-code and suitable for use in real-world, large-scale data mining projects, and provides a comprehensive, practical look at the concepts and techniques you need to get the most out of real business data. Expand