{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:07:39Z","timestamp":1726409259706},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319469218"},{"type":"electronic","value":"9783319469225"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46922-5_7","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T10:40:50Z","timestamp":1474368050000},"page":"82-94","source":"Crossref","is-referenced-by-count":0,"title":["Continuous Maximum Visibility Query for a Moving Target"],"prefix":"10.1007","author":[{"given":"Ch. Md.","family":"Rakin Haider","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arif","family":"Arman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Eunus","family":"Ali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhana Murtaza","family":"Choudhury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"issue":"5","key":"7_CR1","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/s00778-010-0182-x","volume":"19","author":"ME Ali","year":"2010","unstructured":"Ali, M.E., Tanin, E., Zhang, R., Kulik, L.: A motion-aware approach for efficient evaluation of continuous queries on 3d object databases. VLDB J. 19(5), 603\u2013632 (2010)","journal-title":"VLDB J."},{"issue":"4","key":"7_CR2","first-page":"461","volume":"27","author":"B Aronov","year":"2002","unstructured":"Aronov, B., Guibas, L.J., Teichmann, M., Zhang, L.: Visibility queries and maintenance in simple polygons. DCG 27(4), 461\u2013483 (2002)","journal-title":"DCG"},{"issue":"1","key":"7_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T Asano","year":"1986","unstructured":"Asano, T., Guibas, L.J., Hershberger, J., Imai, H.: Visibility of disjoint polygons. Algorithmica 1(1), 49\u201363 (1986)","journal-title":"Algorithmica"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Moshe B., Hall-Holt, O., Katz, M.J., Mitchell, J.S.B.: Computing the visibility graph of points within a polygon. In: SCG, pp. 27\u201335 (2004)","DOI":"10.1145\/997817.997825"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.is.2013.12.002","volume":"42","author":"FM Choudhury","year":"2014","unstructured":"Choudhury, F.M., Ali, M.E., Masud, S., Nath, S., Rabban, I.E.: Scalable visibility color map construction in spatial databases. Inf. Syst. 42, 89\u2013106 (2014)","journal-title":"Inf. Syst."},{"issue":"1","key":"7_CR6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0146-664X(79)90076-5","volume":"11","author":"LS Davis","year":"1979","unstructured":"Davis, L.S., Benedikt, M.L.: Computational models of space: Isovists and isovist fields. Comput. Graph. Image Process. 11(1), 49\u201372 (1979)","journal-title":"Comput. Graph. Image Process."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Gao, Y., Zheng, B.: Continuous obstructed nearest neighbor queries in spatial databases. In: SIGMOD, pp. 577\u2013590 (2009)","DOI":"10.1145\/1559845.1559906"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Gao, Y., Zheng, B., Lee, W., Chen, G.: Continuous visible nearest neighbor queries. In: EDBT, pp. 144\u2013155 (2009)","DOI":"10.1145\/1516360.1516378"},{"key":"7_CR9","volume-title":"Concrete Mathematics","author":"R Graham","year":"1994","unstructured":"Graham, R., Knuth, D., Patashnik, O.: Concrete Mathematics. Addison-Wesley, Boston (1994)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Masud, S., Choudhury, F.M., Ali, M.E., Nutanong, S.: Maximum visibility queries in spatial databases keys. In: ICDE, pp. 637\u2013648 (2013)","DOI":"10.1109\/ICDE.2013.6544862"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1007\/978-3-540-71703-4_73","volume-title":"Advances in Databases: Concepts, Systems and Applications","author":"S Nutanong","year":"2007","unstructured":"Nutanong, S., Tanin, E., Zhang, R.: Visible nearest neighbor queries. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 876\u2013883. Springer, Heidelberg (2007)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-319-22363-6_11","volume-title":"Advances in Spatial and Temporal Databases","author":"IE Rabban","year":"2015","unstructured":"Rabban, I.E., Abdullah, K., Ali, M.E., Cheema, M.A.: Visibility color map for a fixed or moving target in spatial databases. In: Claramunt, C., Schneider, M., Wong, R.C.-W., Xiong, L., Loh, W.-K., Shahabi, C., Li, K.-J. (eds.) SSTD 2015. LNCS, vol. 9239, pp. 197\u2013215. Springer, Heidelberg (2015)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Shou, L., Huang, Z., Tan, K.-L.: Hdov-tree: the structure, the storage, the speed. In: ICDE (2003)","DOI":"10.1109\/ICDE.2003.1260821"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Suri, S., ORourke, J.: Worst-case optimal algorithms for constructing visibility polygons with holes. In: SCG, pp. 14\u201323 (1986)","DOI":"10.1145\/10515.10517"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Zarei, A.R., Ghodsi, M.: Efficient computation of query point visibility in polygons with holes. In: SCG, pp. 6\u20138 (2005)","DOI":"10.1145\/1064092.1064140"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46922-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T19:57:36Z","timestamp":1568404656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46922-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319469218","9783319469225"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46922-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}