Continuous Maximum Visibility Query for a Moving Target
Opportunities to answer many real life queries such as “which surveillance camera has the best view of a moving car in the presence of obstacles?” have become a reality due to the development of location based services and recent advances in 3D modeling of urban environments. In this paper, we investigate the problem of continuously finding the best viewpoint from a set of candidate viewpoints that provides the best view of a moving target in presence of visual obstacles in 2D or 3D space. We propose a query type called k Continuous Maximum Visibility (kCMV) query that ranks k query viewpoints (or locations) from a set of candidate viewpoints in the increasing order of the visibility measure of the target from these viewpoints. We propose two approaches that reduce the set of query locations and obstacles to consider during visibility computation and efficiently update the results as target moves. We conduct extensive experiments to demonstrate the effectiveness and efficiency of our solutions for a moving target in presence of obstacles.
KeywordsVisibility query Moving object Spatial database
This research is supported by the ICT Division - Government of the People’s Republic of Bangladesh.
- 4.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–35 (2004)Google Scholar
- 7.Gao, Y., Zheng, B.: Continuous obstructed nearest neighbor queries in spatial databases. In: SIGMOD, pp. 577–590 (2009)Google Scholar
- 8.Gao, Y., Zheng, B., Lee, W., Chen, G.: Continuous visible nearest neighbor queries. In: EDBT, pp. 144–155 (2009)Google Scholar
- 10.Masud, S., Choudhury, F.M., Ali, M.E., Nutanong, S.: Maximum visibility queries in spatial databases keys. In: ICDE, pp. 637–648 (2013)Google Scholar
- 12.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–215. Springer, Heidelberg (2015)CrossRefGoogle Scholar
- 13.Shou, L., Huang, Z., Tan, K.-L.: Hdov-tree: the structure, the storage, the speed. In: ICDE (2003)Google Scholar
- 14.Suri, S., ORourke, J.: Worst-case optimal algorithms for constructing visibility polygons with holes. In: SCG, pp. 14–23 (1986)Google Scholar
- 15.Zarei, A.R., Ghodsi, M.: Efficient computation of query point visibility in polygons with holes. In: SCG, pp. 6–8 (2005)Google Scholar