Abstract
In this paper, we study the Obstructed Nearest Neighbor (ONN) problem: given a set of points and a set of polygonal obstacles in two dimensions, find the k nearest neighbors to a query point according to the length of the shortest obstacle-avoiding path between two points. ONN query is useful both as a stand-alone tool in geographical information systems and as a primitive for spatial data analysis such as clustering and classification in the presence of obstacles. We propose an efficient ONN algorithm that processes only the data points and obstacles relevant to the query in an incremental way and thus filters out a large number of points and obstacles. Experiments on spatial data sets show the algorithm scales well with respect to the input data size and the number of nearest neighbors requested.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R∗-tree: An efficient and robust access method for points and rectangles. pp. 322–331 (1990)
Benetis, R., Jensen, C., Karciauskas, G., Saltenis, S.: Nearest neighbor and reverse nearest neighbor queries for moving objects (2002)
Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: An index structure for highdimensional data. pp. 28–39 (1996)
Böhm, C., Berchtold, S., Keim, D.A.: Searching in high dimensional spaces: index structures for improving the performance of multimedia databases. ACM Computing Surveys 33(3), 322–373 (2001)
Cheung, K.L., Fu, A.W.C.: Enhanced nearest neighbor search on the R-tree. SIGMOD Record 27(3), 16–21 (1998)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. Second Edition, 2nd edn. MIT Press, Cambridge (2001)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)
Ester, M., Kriegel, H., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. pp. 226–231 (1996)
Ferhatosmanoglu, H., Stanoi, I., Agrawal, D., El Abbadi, A.: Constrained nearest neighbor queries. pp. 257–278 (2001)
Ghosh, S.K., Mount, D.M.: An output sensitive algorithm for computing visibility graphs. pp. 11–19 (1987)
Guttman, A.: R-trees: A dynamic index structure for spatial searching. pp. 47–57 (1984)
Henrich, A.: A distance scan algorithm for spatial access structures. pp. 136–143 (1994)
Hershberger, J., Suri, S.: An optimal algorithm for euclidean shortest paths in the plane. SIAM J. on Computing 28(6), 2215–2256 (1999)
Hjaltason, G., Samet, H.: Ranking in spatial databases. pp. 83–95 (1995)
Hjaltason, G., Samet, H.: Distance browsing in spatial databases. ACM Transactions on Database Systems 24(2), 265–318 (1999)
James, M.: Classification Algorithms. John Wiley & Sons, Chichester (1985)
Karypis, G., Han, E.H., Kumar, V.: Chameleon: Hierarchical clustering using dynamic modeling. Computer 32(8), 68–75 (1999)
Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. pp. 201–212 (2000)
O’Rourke, J.: Computational geometry: algorithms and applications, 2nd edn. Springer, Heidelberg (2000)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. pp. 71–79 (1995)
Sellis, T., Roussopoulos, N., Faloutsos, C.: The R+-tree: A dynamic index for multi– dimensional objects. pp. 507–518 (1987)
Tao, Y., Papadias, D.: Time-parameterized queries in spatio-temporal databases. pp. 334–345 (2002)
Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. pp. 287–298 (2002)
Tung, A.K.H., Hou, J., Han, J.: Spatial clustering in the presence of obstacles. pp. 359–367 (2001)
Zhang, J., Papadias, D., Mouratidis, K., Zhu, M.: Spatial queries in the presence of obstacles (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xia, C., Hsu, D., Tung, A.K.H. (2004). A Fast Filter for Obstructed Nearest Neighbor Queries. In: Williams, H., MacKinnon, L. (eds) Key Technologies for Data Management. BNCOD 2004. Lecture Notes in Computer Science, vol 3112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27811-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-27811-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22382-5
Online ISBN: 978-3-540-27811-5
eBook Packages: Springer Book Archive