A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Spatial Queries in the Presence of Obstacles
[chapter]
2004
Lecture Notes in Computer Science
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are directly reachable. In this paper, we study spatial queries in the presence of obstacles, where the obstructed distance between two points is defined as the length of the shortest path that connects them without crossing any obstacles. We propose efficient algorithms for the most important query types, namely, range
doi:10.1007/978-3-540-24741-8_22
fatcat:fw53ai3dgzexnnsgrnj3zjtt4a