Visibility Color Map for a Fixed or Moving Target in Spatial Databases

  • Ishat E. RabbanEmail author
  • Kaysar Abdullah
  • Mohammed Eunus Ali
  • Muhammad Aamir Cheema
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9239)


The widespread availability of 3D city models enables us to answer a wide range of spatial visibility queries in the presence of obstacles (e.g., buildings). Example queries include “what is the best position for placing a billboard in a city?” or “which hotel gives the best view of the city skyline?”. These queries require computing and differentiating the visibility of a target object from each viewpoint of the surrounding spe. A recent approach models the visibility of a fixed target object from the surrounding area with a visibility color map (VCM), where each point in the space is assigned a color value denoting the visibility measure of the target. In the proposed VCM, a viewpoint is simply discarded (i.e., considered as non-visible) if an obstacle even slightly blocks the view of the target from the viewpoint, which restricts its applicability for a wide range of applications. To alleviate this limitation, in this paper, we propose a scalable, efficient and comprehensive solution to construct a VCM for a fixed target that considers the partial visibility of the target from viewpoints. More importantly, our proposed data structures for the fixed target support incremental updates of the VCM if the target moves to near-by positions. Our experimental results show that our approach is orders of magnitude faster than the straightforward approach.



This research is supported by the ICT ministry - Bangladesh innovation fund for the project “Visibility Queries in 3D Spatial Databases”. Muhammad Aamir Cheema is supported by ARC DE130101002 and DP130103405.


  1. 1.
    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–106 (2014)CrossRefGoogle Scholar
  2. 2.
    Durand, F., Drettakis, G., Thollot, J., Puech, C.: Conservative visibility preprocessing using extended projections. In: SIGGRAPH, pp. 239–248 (2000)Google Scholar
  3. 3.
    Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp. 47–57 (1984)Google Scholar
  4. 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
  5. 5.
    Suri, S., O’Rourke, J.: Worst-case optimal algorithms for constructing visibility polygons with holes. In: SCG, pp. 14–23 (1986)Google Scholar
  6. 6.
    Asano, T., Asano, T., Guibas, L., Hershberger, J., Imai, H.: Visibility-polygon search and euclidean shortest paths. In: SFCS, pp. 155–164 (1985)Google Scholar
  7. 7.
    James Stewart, A., Karkanis, T.: Computing the approximate visibility map, with applications to form factors and discontinuity meshing. In: Drettakis, G., Max, N. (eds.) Rendering Techniques 1998. Eurographics, pp. 57–68. Springer, Vienna (1998)Google Scholar
  8. 8.
    Grasset, J., Terraz, O., Hasenfratz, J.M., Plemenos, D.: Accurate scene display by using visibility maps. In: SCCG, pp. 180–186 (1999)Google Scholar
  9. 9.
    Bittner, J.: Efficient construction of visibility maps using approximate occlusion sweep. In: SCCG, pp. 167–175 (2002)Google Scholar
  10. 10.
    Tsai, Y.H.R., Cheng, L.T., Osher, S., Burchard, P., Sapiro, G.: Visibility and its dynamics in a PDE based implicit framework. J. Comput. Phys. 199(1), 260–290 (2004)zbMATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Kim, D.S., Yoo, K.H., Chwa, K.Y., Shin, S.Y.: Efficient algorithms for computing a complete visibility region in three-dimensional space. Algorithmica 20(2), 201–225 (1998)zbMATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    Koltun, V., Chrysanthou, Y., Cohen-Or, D.: Hardware-accelerated from-region visibility using a dual ray space. In: Gortler, S.J., Myszkowski, K. (eds.) Rendering Techniques 2001. Eurographics, pp. 205–215. Springer, Vienna (2001)CrossRefGoogle Scholar
  13. 13.
    Koltun, V., Chrysanthou, Y., Cohen-Or, D.: Virtual occluders: an efficient intermediate pvs representation. In: Péroche, B., Rushmeier, H. (eds.) Rendering Techniques 2000. Eurographics, pp. 59–70. Springer, Vienna (2000)CrossRefGoogle Scholar
  14. 14.
    Hernndez, J., Garca, L., Ayuga, F.: Assessment of the visual impact made on the landscape by new buildings: a methodology for site selection. Landsc. Urb. Plan. 68(1), 15–28 (2004)CrossRefGoogle Scholar
  15. 15.
    Bartie, P., Reitsma, F., Kingham, S., Mills, S.: Advancing visibility modelling algorithms for urban environments. Comput. Environ. Urb. Syst. 34(6), 518–531 (2010)CrossRefGoogle Scholar
  16. 16.
    Google sketchup.
  17. 17.
  18. 18.
  19. 19.
    Nutanong, S., Tanin, E., Zhang, R.: Incremental evaluation of visible nearest neighbor queries. IEEE Trans. Knowl. Data Eng. 22, 665–681 (2010)CrossRefGoogle Scholar
  20. 20.
    Gao, Y., Zheng, B.: Continuous obstructed nearest neighbor queries in spatial databases. In: SIGMOD, pp. 577–590 (2009)Google Scholar
  21. 21.
    Gao, Y., Zheng, B., Lee, W.C., Chen, G.: Continuous visible nearest neighbor queries. In: EDBT, pp. 144–155 (2009)Google Scholar
  22. 22.
    Masud, S., Choudhury, F.M., Ali, M.E., Nutanong, S.: Maximum visibility queries in spatial databases. In: ICDE, pp. 637–648 (2013)Google Scholar
  23. 23.
    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, 603–632 (2010)CrossRefGoogle Scholar
  24. 24.
    Kaiser, P.: The Joy of Visual Perception. York University, Toronto (1996)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Ishat E. Rabban
    • 1
    Email author
  • Kaysar Abdullah
    • 1
  • Mohammed Eunus Ali
    • 1
  • Muhammad Aamir Cheema
    • 2
  1. 1.Department of Computer Science and EngineeringBangladesh University of Engineering and TechnologyDhakaBangladesh
  2. 2.Faculty of Information TechnologyMonash UniversityClaytonAustralia

Personalised recommendations