Skip to main content
SpringerLink
Log in

A data management scheme for effective walkthrough in large-scale virtual environments

  • original article
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

As the complexity of virtual environments increases, it becomes a critical issue to maintain the quality of a walkthrough experience. In this paper, we propose an effective data management scheme to address this issue in client-server architecture. First, we propose using real-time scene management to manage the computing resources on the client side by reducing the amount of transmitted geometry data. Second, we propose a prioritized most likelihood movement model to prefetch potential future objects based on the user’s current motion intention. Lastly, a hybrid coherence cache model is proposed to take advantages of both the temporal and spatial localities of the walkthrough process. We have done extensive experiments to demonstrate how these techniques can improve the effectiveness of walkthrough in a large virtual environment.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Airey J, Rohlf J, Brooks F (1990) Towards image realism with interactive update rates in complex virtual building environments. In: Proceedings of ACM 1990 Symposium on Interactive 3D Graphics, pp 41–50

  2. Berg M, Kreveld M, Overmars M, Schwarzkopf O (1997) Computational geometry-algorithms and applications. Springer, Berlin Heidelberg New York, pp 20–29

  3. Chan A, Lau RWH, Si A (2001) A motion prediction method for mouse-based navigation. In: Proceedings of Computer Graphics International 2001. IEEE Computer Society Press, pp 139–146

  4. Chan BYL, Si A, Leong HV (1998) Cache management for mobile databases: design and evaluation. In: Proceedings of the IEEE International Conference on Data Engineering, pp 54–63

  5. Chim J, Lau R, Leong H, Si A (1998) Multi-resolution cache management in digital virtual library. In: Proceedings of IEEE Advances in Digital Library, pp 66–75

  6. Coorg S, Teller S (1996) Temporally coherent conservative visibility. In: Proceedings of the Twelfth Annual Symposium on Computational Geometry, pp 78–87

  7. DeHaemer M, Zyda M (1991) Simplification of objects rendered by polygonal approximations. Comput Graph 15(2):175–184

    Article  Google Scholar 

  8. Franklin M, Carey M, Livny M (1992) Global memory management in client-server DBMS architectures. In: Proceedings of the International Conference on Very Large Database, pp 596–609

  9. Funkhouser A, Seqin H, Teller J (1992) Management of large amounts of data in interactive building walkthroughs. In: Proceedings of the 1992 Symposium on Interactive 3D Graphics, pp 11–20

  10. Gigus Z, Canny Seidel R (1991) Efficiently computing and representing aspect graphs of polyhedral objects. IEEE Trans Pattern Anal Mach Intell 13(4):542–551

    Article  Google Scholar 

  11. Gigus Z, Malik J (1990) Computing the aspect graph for line drawings of polyhedral objects. IEEE Trans Pattern Anal Mach Intell 12(2):113–122

    Article  Google Scholar 

  12. Hoppe H, DeRose T, Duchamp T, McDonald J, Stuetzle W (1993) Mesh optimization. In: Proceedings of ACM Computer Graphics Conference (SIGGRAPH’93), pp 19–26

  13. Katz A, Graham K (1994) Dead reckoning for airplanes in coordinated flight. In: Proceedings of Workshop on Standards for Interoperability of Defense Simulations, pp 5–13

  14. Liu G, Maguire G (1996) A class of mobile motion prediction algorithms for wireless mobilecomputing and communications. Mobile Netw Appl 1(2):113–121

    Article  Google Scholar 

  15. Macedonia MR, Zyda MJ, Pratt DR, Barham PT, Zeswitz S (1994) NPSNET: A network software architecture for large-scale virtual environments. Presence 3(3):265–287

    Article  Google Scholar 

  16. Park S, Lee D, Lim M, Yu C (2001) Scalable data management using user-based caching and prefetching in distributed virtual environments. In: Proceedings of Symposium on Virtual Reality Software and Technology, pp 121–126

  17. Taubin G, Rossignac J (1998) Geometric compression through topological surgery. ACM Trans Graph 17(2):84–115

    Article  Google Scholar 

  18. Teller S, Sequin C (1991) Visibility preprocessing for interactive walkthroughs. In: Proceedings of ACM Computer Graphics Conference (SIGGRAPH91), pp 61–69

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, National Chengchi University, 64, Sec. 2, Zhih-Nan Rd., Taipei, 11623, Taiwan

    Tsai-Yen Li & Wen-Hsiang Hsu

Authors
  1. Tsai-Yen Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wen-Hsiang Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tsai-Yen Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, TY., Hsu, WH. A data management scheme for effective walkthrough in large-scale virtual environments. Vis Comput 20, 624–634 (2004). https://doi.org/10.1007/s00371-004-0264-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-004-0264-0

Keywords

Search

Navigation