A multi-resolution surface distance model for k-NN query processing

VLDB Journal

Volumn 17, Issue 5, 2008, Pages 1101-1119

  Deng, Ke ^a   Zhou, Xiaofang ^a   Shen, Heng Tao ^a   Liu, Qing ^a   Xu, Kai ^b   Lin, Xuemin ^c  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b CSIRO   (Australia)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 46749086744     PISSN: 10668888     EISSN: 0949877X     Source Type: Journal    
DOI: 10.1007/s00778-007-0053-2     Document Type: Article

References (27)

1. Chen, J., Han, Y.: Shortest paths on a polyhedron. In: 6th ACM Symp. Comput. Geometry, pp. 360-369 (1990)
2. Deng, K., Zhou, X.: Expansion-based algorithms for finding single pair shortest path on surface. In: Proc. of W2GIS, pp. 254-271 (2004)
3. Deng, K., Zhou, X., Shen, H.T., Xu, K., Lin, X.: Surface k-NN query processing. In: ICDE (2006)
4. Dijkstra E.W. (1959). A note on two problems in connection with graphs. Numer. Math. 1: 269-271
5. Garland, M.: Multiresolution modeling: survey and future opportunities. In: Eurographics, pp. 111-131 (1999)
6. Garland, M., Heckbert, P.S.: Surface simplification using quadric error metrics. In: 24th Int'l Conf. on Comput. Graphics and Interactive Tech. pp. 209-216 (1997)
7. Hjaltason G.R. and Samet H. (1999). Distance browsing in spatial databases. TODS 24(2): 265-318
8. Hoppe, H.: Progressive meshes. In: SIGGRAPH (1996)
9. +-tree based indexing method for nearest neighbour search. TODS (2005)
10. Jiang, B.: I/O efficiency of shortest path algorithms: an analysis. ICDE (1992)
11. Kanai, T., Suzuki, H.: Approximate shortest path on polyhedral surface based on selective refinement of the discrete graph and its applications. Geom. Model. Process. 241-250 (2000)
12. Kaneva, B., O'Rourke, J.: An implementation of Chen & Han's shortest paths algorithm. In: Proc. of 12th Canadian Conf. on Comput. Geom. pp. 139-146 (2000)
13. Kapoor, S.: Efficient computation of geodesic shortest paths. In: 31st Annual ACM Symp. on Theory of Computation, pp. 770-779 (1999)
14. Kolahdouzan, M.R., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. VLDB (2004)
15. Li Z. and Openshaw S. (1992). Algorithms for automated line generalization based on a natural principle of objective generalization. J. GIS 6(5): 373-389
16. Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Handbook of Computational Geometry, Sack, J.-R., Urrutia, J. (eds) pp. 633-701 (2000)
17. Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. VLDB (2003)
18. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. SIGMOD (1995)
19. Seidl, T., Kriegel, H.P.: Optimal multi-step k-nearest neighbor search. SIGMOD (1998)
20. Shahabi, C., Kolahdouzan, M.R., Sharifzadeh, M.: A road network embedding technique for k-nearest neighbor search in moving object databases. In: ACM GIS, pp. 94-100 (2002)
21. Shekhar, S., Kohli, A., Coyle, M.: Path computation algorithms for advanced traveler information system (atis). ICDE (1993)
22. Shekhar S. and Liu D. (1997). A connectivity-cluster access method for networks and network computations. TKDE 19(1): 102-119
23. Tompkins, P., Stentz, T., Whittaker, W.: Mission planning for the sun-synchronous navigation field experiment. In: IEEE Int'l Conf. on Robotics and Automation, pp. 3493-3500 (2002)
24. Varadarajan, K.R., Agarwal, P.: Approximating shortest paths on an nonconvex polyhedron. In: Proc. 38th Annu. IEEE Symp. Found. Comput. Sci. pp. 182-191 (1997)
25. Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. VLDB (1998)
26. Xu, K., Zhou, X., Lin, X.: Direct mesh: a multiresolution approach to terrain visualisation. ICDE (2004)
27. Yiu M.L., Mamoulis N. and Papadias D. (2005). Aggregate nearest neighbor queries in road networks. TKDE 17(6): 820-833