
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sarana Nutanong, Egemen Tanin, Rui Zhang, "Incremental Evaluation of Visible Nearest Neighbor Queries," IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 5, pp. 665681, May, 2010.  
BibTex  x  
@article{ 10.1109/TKDE.2009.158, author = {Sarana Nutanong and Egemen Tanin and Rui Zhang}, title = {Incremental Evaluation of Visible Nearest Neighbor Queries}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {22}, number = {5}, issn = {10414347}, year = {2010}, pages = {665681}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.158}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Incremental Evaluation of Visible Nearest Neighbor Queries IS  5 SN  10414347 SP665 EP681 EPD  665681 A1  Sarana Nutanong, A1  Egemen Tanin, A1  Rui Zhang, PY  2010 KW  Geographical information systems KW  spatial databases KW  query processing. VL  22 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] B. Aronov, L.J. Guibas, M. Teichmann, and L. Zhang, "Visibility Queries and Maintenance in Simple Polygons," Discrete & Computational Geometry, vol. 27, no. 4, pp. 461483, 2002.
[2] T. Asano, T. Asano, L.J. Guibas, J. Hershberger, and H. Imai, "VisibilityPolygon Search and Euclidean Shortest Paths," Proc. 26th Ann. Symp. Foundations of Computer Science (FOCS), pp. 155164, 1985.
[3] T. Asano, T. Asano, L.J. Guibas, J. Hershberger, and H. Imai, "Visibility of Disjoint Polygons," Algorithmica, vol. 1, no. 1, pp. 4963, 1986.
[4] N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger, "The R$^{\ast}$ tree: An Efficient and Robust Access Method for Points and Rectangles," Proc. ACM SIGMOD, pp. 322331, 1990.
[5] J.L. Bentley, "Multidimensional Binary Search Trees Used for Associative Searching," Comm. ACM, vol. 18, no. 9, pp. 509517, 1975.
[6] A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, "Closest Pair Queries in Spatial Databases," Proc. ACM SIGMOD, pp. 189200, 2000.
[7] E.W. Dijkstra, "A Note on Two Problems in Connection with Graphs," Numeriche Mathematik, vol. 1, pp. 269271, 1959.
[8] K. Engel, M. Hadwiger, C. RezkSalama, and J.M. Kniss, RealTime Volume Graphics, A K Peters Ltd., 2006.
[9] H. Ferhatosmanoglu, I. Stanoi, D. Agrawal, and A. El Abbadi, "Constrained Nearest Neighbor Queries," Proc. Int'l Symp. Spatial and Temporal Databases (SSTD), pp. 257278, 2001.
[10] Y. Gao, B. Zheng, G. Chen, W.C. Lee, K. Lee, and Q. Li, "Visible Reverse KNearest Neighbor Queries," Proc. IEEE Int'l Conf. Data Eng. (ICDE), 2009.
[11] S.K. Ghosh and D.M. Mount, "An OutputSensitive Algorithm for Computing Visibility Graphs," SIAM J. Computing, vol. 20, no. 5, pp. 888910, 1991.
[12] A. Guttman, "Rtrees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD, pp. 4757, 1984.
[13] P.J. Heffernan and J.S.B. Mitchell, "An Optimal Algorithm for Computing Visibility in the Plane," SIAM J. Computing, vol. 24, no. 1, pp. 184201, 1995.
[14] G.R. Hjaltason and H. Samet, "Distance Browsing In Spatial Databases," ACM Trans. Database Systems, vol. 24, no. 2, pp. 265318, 1999.
[15] L. Kulik and E. Tanin, "Incremental Rank Updates for Moving Query Points," Proc. GIScience, pp. 251268, 2006.
[16] K.C.K. Lee, W.C. Lee, and H.V. Leong, "Nearest Surrounder Queries," Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp. 8594, 2006.
[17] K.C.K. Lee, J. Schiffman, B. Zheng, W.C. Lee, and H.V. Leong, "RoundEye: A System for Tracking Nearest Surrounders in Moving Object Environments," J. Systems and Software, vol. 80, no. 12 pp. 20632076, 2007.
[18] S. Nutanong, E. Tanin, and R. Zhang, "Visible Nearest Neighbor Queries," Proc. Database Systems for Advanced Applications (DASFAA), pp. 876883, 2007.
[19] S. Nutanong, R. Zhang, E. Tanin, and L. Kulik, "The V$^{\ast}$ Diagram: A Query Dependent Approach to Moving kNN Queries," Proc. 29th Int'l Conf. Very Large Data Bases (VLDB), pp. 10951106, 2008.
[20] D. Papadias, Y. Tao, K. Mouratidis, and C.K. Hui, "Aggregate Nearest Neighbor Queries in Spatial Databases," ACM Trans. Database Systems, vol. 30, no. 2, pp. 529576, 2005.
[21] D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, "Query Processing in Spatial Network Databases," Proc. 29th Int'l Conf. Very Large Data Bases (VLDB), pp. 802813, 2003.
[22] N. Roussopoulos, S. Kelley, and F. Vincent, "Nearest Neighbor Queries," Proc. ACM SIGMOD, pp. 7179, 1995.
[23] H. Samet, "DepthFirst KNearest Neighbor Finding Using the MaxNearestDist Estimator," Proc. Int'l Conf. Image Analysis and Processing (ICIAP), pp. 486491, 2003.
[24] H. Samet, Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, 2006.
[25] S. Suri and J. O'Rourke, "WorstCase Optimal Algorithms for Constructing Visibility Polygons with Holes," Proc. Symp. Computational Geometry, pp. 1423, 1986.
[26] Y. Tao, D. Papadias, X. Lian, and X. Xiao, "Multidimensional Reverse $k$ nn Search," VLDB J., vol. 16, no. 3, pp. 293316, 2007.
[27] A.K.H. Tung, J. Hou, and J. Han, "Spatial Clustering in the Presence of Obstacles," Proc. Int'l Conf. Data Eng. (ICDE), pp. 359367, 2001.
[28] B.R. Vatti, "A Generic Solution to Polygon Clipping," Comm. ACM, vol. 35, no. 7 pp. 5663, 1992.
[29] A. Zarei and M. Ghodsi, "Efficient Computation of Query Point Visibility in Polygons with Holes," Proc. Symp. Computational Geometry, pp. 314320, 2005.
[30] J. Zhang, D. Papadias, K. Mouratidis, and M. Zhu, "Spatial Queries in the Presence of Obstacles," Proc. Ninth Int'l. Conf. Extending Database Technology (EDBT), pp. 366384, 2004.
[31] J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D.L. Lee, "LocationBased Spatial Queries," Proc. ACM SIGMOD, pp. 443454, 2003.