Spatial Queries in the Presence of Obstacles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2992, Issue , 2004, Pages 366-384

  Zhang, Jun ^a   Papadias, Dimitris ^a   Mouratidis, Kyriakos ^a   Zhu, Manli ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION TREES; NEAREST NEIGHBOR SEARCH; QUERY LANGUAGES; TREES (MATHEMATICS);

DATABASE APPLICATIONS; EUCLIDEAN DISTANCE; NEAREST NEIGHBORS; OBSTRUCTED DISTANCE; RANGE SEARCH; SHORTEST PATH; SPATIAL QUERIES; SPATIAL QUERY PROCESSING;

QUERY PROCESSING;

EID: 35048890162     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24741-8_22     Document Type: Article

References (22)

1. [AGHI86] Asano, T., Guibas, L., Hershberger, J., Imai, H. Visibility of Disjoint Polygons. Algorithmica 1, 49-63, 1986.
2. [BKOS97] de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O. Computational Geometry, pp. 305-315, Springer, 1997.
3. [BKS93] Brinkhoff, T., Kriegel, H., Seeger, B. Efficient Processing of Spatial Joins Using R-trees. SIGMOD, 1993.
4. [BKSS90] Becker, B., Kriegel, H., Schneider, R, Seeger, B. The R*-tree: An Efficient and Robust Access Method. SIGMOD, 1990.
5. [CMTV00] Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M. Closest Pair Queries in Spatial Databases. SIGMOD, 2000.
6. [D59] Dijkstra, E. A Note on Two Problems in Connection with Graphs. Numeriche Mathematik, 1, 269-271, 1959.
7. [EL01] Estivill-Castro, V., Lee, I. Fast Spatial Clustering with Different Metrics in the Presence of Obstacles. ACM GIS, 2001.
8. [G84] Guttman, A. R-trees: A Dynamic Index Structure for Spatial Searching. SIGMOD, 1984.
9. [GM87] Ghosh, S., Mount, D. An Output Sensitive Algorithm for Computing Visibility Graphs. FOCS, 1987.
10. [HS98] Hjaltason, G., Samet, H. Incremental Distance Join Algorithms for Spatial Databases. SIGMOD, 1998.
11. [HS99] Hjaltason, G., Samet, H. Distance Browsing in Spatial Databases. TODS, 24(2), 265-318,1999.
12. [KHI+86] Kung, R., Hanson, E., Ioannidis, Y., Sellis, T., Shapiro, L. Stonebraker, M. Heuristic Search in Data Base Systems. Expert Database Systems, 1986.
13. [LW79] Lozano-Pérez, T., Wesley, M. An Algorithm for Planning Collision-free Paths among Polyhedral Obstacles. CACM, 22(10), 560-570, 1979.
14. [PV95] Pocchiola, M., Vegter, G. Minimal Tangent Visibility Graph. Computational Geometry: Theory and Applications, 1995.
15. [PV96] Pocchiola, M., Vegter, G. Topologically Sweeping Visibility Complexes via Pseudo-triangulations. Discrete Computational Geometry, 1996.
16. [PZMT03] Papadias, D., Zhang, J., Mamoulis, N., Tao, Y. Query Processing in Spatial Network Databases. VLDB, 2003.
17. [R95] Rivière, S. Topologically Sweeping the Visibility Complex of Polygonal Scenes. Symposium on Computational Geometry, 1995.
18. [SRF87] Sellis, T., Roussopoulos, N. Faloutsos, C. The R+-tree: a Dynamic Index for Multi-Dimensional Objects. VLDB, 1987.
19. [SS84] Sharir, M., Schorr, A. On Shortest Paths in Polyhedral Spaces. STOC, 1984.
20. [THH01] Tung, A., Hou, J., Han, J. Spatial Clustering in the Presence of Obstacles. ICDE, 2001.
21. 2) Time, Information Processing Letters 20, 167-171, 1985.
22. [Web] http://www.maproom.psu.edu/dcw.