Abstract
Visibility query is fundamental to many analysis and decision-making tasks in virtual environments. Visibility computation is time complex and the complexity escalates in large and dynamic environments, where the visibility set (i.e., the set of visible objects) of any viewpoint is probe to change at any time. However, exact visibility query is rarely necessary. Besides, it is inefficient, if not infeasible, to obtain the exact result in a dynamic environment. In this paper, we formally define an Approximate Visibility Query (AVQ) as follows: given a viewpoint v, a distance ε and a probability p, the answer to an AVQ for the viewpoint v is an approximate visibility set such that its difference with the exact visibility set is guaranteed to be less than ε with confidence p. We propose an approach to correctly and efficiently answer AVQ in large and dynamic environments. Our extensive experiments verified the efficiency of our approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Airey, J.M., Rohlf, J.H., Brooks Jr., F.P.: Towards image realism with interactive update rates in complex virtual building environments. SIGGRAPH 24(2), 41–50 (1990)
Batagelo, H., Shin-Ting, W.: Dynamic scene occlusion culling using a regular grid. In: Computer Graphics and Image Processing, pp. 43–50 (2002)
Bittner, J., Havran, V., Slavk, P.: Hierarchical visibility culling with occlusion trees. In: CGI, pp. 207–219. IEEE, Los Alamitos (1998)
Bukauskas, L., Mark, L., Omiecinski, E., Böhlen, M.H.: itopn: incremental extraction of the n most visible objects. In: CIKM, pp. 461–468 (2003)
Chenney, S., Forsyth, D.: View-dependent culling of dynamic systems in virtual environments. In: SI3D, pp. 55–58 (1997)
Cohenor, D., Chrysanthou, Y., Silva, C.T., Durand, F.: A survey of visibility for walkthrough applications. IEEE Transactions on Visualization and Computer Graphics 9(3), 412–431 (2003)
Erikson, C., Manocha, D., Baxter III., V.: Hlods for faster display of large static and dynamic environments. In: I3D, pp. 111–120 (2001), doi:10.1145/364338.364376
Gibbons, P.B., Matias, Y., Poosala, V.: Fast incremental maintenance of approximate histograms. ACM Trans. Database Syst. 27(3), 261–298 (2002)
Greene, N., Kass, M., Miller, G.: Hierarchical z-buffer visibility. In: SIGGRAPH, pp. 231–238 (1993)
Kofler, M., Gervautz, M., Gruber, M.: R-trees for organizing and visualizing 3d gis databases. Journal of Visualization and Computer Animation 11(3), 129–143 (2000)
Lee, K.C.K., Lee, W.-C., Leong, H.V.: Nearest surrounder queries. In: ICDE, p. 85 (2006)
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–883. Springer, Heidelberg (2007)
Samet, H.: Foundations of Multidimensional and Metric Data Structures (2005)
Shou, L., Chionh, J., Huang, Z., Ruan, Y., Tan, K.-L.: Walking through a very large virtual environment in real-time. In: VLDB, pp. 401–410 (2001)
Shou, L., Huang, Z., Tan, K.-L.: Hdov-tree: The structure, the storage, the speed. In: ICDE, pp. 557–568 (2003)
Sudarsky, O., Gotsman, C.: Output-senstitive rendering and communication in dynamic virtual environments. In: VRST, pp. 217–223 (1997)
Teller, S.J., Séquin, C.H.: Visibility preprocessing for interactive walkthroughs. SIGGRAPH 25(4), 61–70 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kazemi, L., Banaei-Kashani, F., Shahabi, C., Jain, R. (2010). Efficient Approximate Visibility Query in Large Dynamic Environments. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds) Database Systems for Advanced Applications. DASFAA 2010. Lecture Notes in Computer Science, vol 5981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12026-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-12026-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12025-1
Online ISBN: 978-3-642-12026-8
eBook Packages: Computer ScienceComputer Science (R0)