The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Automatically and accurately conflating orthoimagery and street maps
Proceedings of the 12th annual ACM international workshop on Geographic information systems
An approach for heterogeneous and loosely coupled geospatial data distributed computing
Computers & Geosciences
| Hi-index | 0.00 |
One of the difficulties in building a distributed GIS comes from the heterogeneity of spatial databases. In particular, positional mismatches between spatial databases arise due to several reasons, such as different scales, or different ground control points. They result in unreliable outputs of query processing. One simple solution is to correct positional data in spatial databases at each site, according to the most accurate one. This solution is however not practical in most of the cases where the autonomy of each database should be respected. In this paper, we propose a spatial query processing method without correcting positional data in each spatial database. Instead of correcting positional data, we dynamically transform a given query region or position onto each space where spatial objects of each site are located. Our method is based on an elastic transformation method by delaunay triangulation.