{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:58:05Z","timestamp":1759683485405},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212003"},{"type":"electronic","value":"9783540247418"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24741-8_22","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T10:56:54Z","timestamp":1280746614000},"page":"366-384","source":"Crossref","is-referenced-by-count":37,"title":["Spatial Queries in the Presence of Obstacles"],"prefix":"10.1007","author":[{"given":"Jun","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Dimitris","family":"Papadias","sequence":"additional","affiliation":[]},{"given":"Kyriakos","family":"Mouratidis","sequence":"additional","affiliation":[]},{"given":"Manli","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T. Asano","year":"1986","unstructured":"Asano, T., Guibas, L., Hershberger, J., Imai, H.: Visibility of Disjoint Polygons. Algorithmica\u00a01, 49\u201363 (1986)","journal-title":"Algorithmica"},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/978-3-662-03427-9_15","volume-title":"Computational Geometry","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, pp. 305\u2013315. Springer, Heidelberg (1997)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Brinkhoff, T., Kriegel, H., Seeger, B.: Efficient Processing of Spatial Joins Using R-trees. In: SIGMOD (1993)","DOI":"10.1145\/170035.170075"},{"key":"22_CR4","unstructured":"Becker, B., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method. In: SIGMOD (1990)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest Pair Queries in Spatial Databases. In: SIGMOD (2000)","DOI":"10.1145\/342009.335414"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A Note on Two Problems in Connection with Graphs. Numeriche Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numeriche Mathematik"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Estivill-Castro, V., Lee, I.: Fast Spatial Clustering with Different Metrics in the Presence of Obstacles. In: ACM GIS (2001)","DOI":"10.1145\/512191.512193"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: SIGMOD (1984)","DOI":"10.1145\/602259.602266"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Mount, D.: An Output Sensitive Algorithm for Computing Visibility Graphs. In: FOCS (1987)","DOI":"10.1109\/SFCS.1987.6"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Hjaltason, G., Samet, H.: Incremental Distance Join Algorithms for Spatial Databases. In: SIGMOD (1998)","DOI":"10.1145\/276304.276326"},{"issue":"2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G. Hjaltason","year":"1999","unstructured":"Hjaltason, G., Samet, H.: Distance Browsing in Spatial Databases. TODS\u00a024(2), 265\u2013318 (1999)","journal-title":"TODS"},{"key":"22_CR12","unstructured":"Kung, R., Hanson, E., Ioannidis, Y., Sellis, T., Shapiro, L., Stonebraker, M.: Heuristic Search in Data Base Systems. Expert Database Systems (1986)"},{"issue":"10","key":"22_CR13","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T. Lozano-P\u00e9rez","year":"1979","unstructured":"Lozano-P\u00e9rez, T., Wesley, M.: An Algorithm for Planning Collision-free Paths among Polyhedral Obstacles. CACM\u00a022(10), 560\u2013570 (1979)","journal-title":"CACM"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Pocchiola, M., Vegter, G.: Minimal Tangent Visibility Graph. Computational Geometry: Theory and Applications (1995)","DOI":"10.1016\/0925-7721(95)00016-X"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Pocchiola, M., Vegter, G.: Topologically Sweeping Visibility Complexes via Pseudo-triangulations. Discrete Computational Geometry (1996)","DOI":"10.1145\/237218.237398"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases. In: VLDB (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Rivi\u00e8re, S.: Topologically Sweeping the Visibility Complex of Polygonal Scenes. In: Symposium on Computational Geometry (1995)","DOI":"10.1145\/220279.220339"},{"key":"22_CR18","unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C.: The R+-tree: a Dynamic Index for Multi-Dimensional Objects. In: VLDB (1987)"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Sharir, M., Schorr, A.: On Shortest Paths in Polyhedral Spaces. In: STOC (1984)","DOI":"10.1145\/800057.808676"},{"key":"22_CR20","unstructured":"Tung, A., Hou, J., Han, J.: Spatial Clustering in the Presence of Obstacles. In: ICDE (2001)"},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","volume":"20","author":"E. Welzl","year":"1985","unstructured":"Welzl, E.: Constructing the Visibility Graph for n Line Segments in O(\n                    \n                      \n                    \n                    ${\\it n}^2$\n                  ) Time. Information Processing Letters\u00a020, 167\u2013171 (1985)","journal-title":"Information Processing Letters"},{"key":"22_CR22","unstructured":"http:\/\/www.maproom.psu.edu\/dcw"}],"container-title":["Lecture Notes in Computer Science","Advances in Database Technology - EDBT 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24741-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:56:00Z","timestamp":1558284960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24741-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212003","9783540247418"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24741-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}