Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Dynamic data structures for realtime management of large geometric scenes

Extended Abstract

  • Conference paper
  • First Online:
Algorithms — ESA '97 (ESA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1284))

Included in the following conference series:

Abstract

We present a data structure problem which describes the requirements of a simple variant of fully dynamic walk-through animation: We assume the scene to consist of unit size balls in ℝ2 or higher dimensions. The scene may be arbitrarily large and has to be stored in secondary memory (discs) with relatively slow access. We allow a visitor to walk in the scene, and a modeler to update the scene by insertions and deletions of balls. We focus on the realtime requirement of animation systems: For some t (specified by the computation power of (the rendering hardware of) the graphic workstation) the data structure has to guarantee that the balls within distance t of the current visitor's position are presented to the rendering hardware, 20 times per second. Insertions and deletions should also be available to the visitor with small delay, independent of the size of the scene. We present a data structure that fulfills the above task in realtime. Its runtime is output-sensitive, i.e. linear in a quantity close to the output size of the query. We further present (preliminary) experimental results indicating that our structure is efficient in practice.

Partially supported by EU ESPRIT Long Term Research Project 20244 (ALCOMIT), DFG Leibniz Grant Me872/6-1 and DFG Grant Me872/7-1

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pankaj K. Agarwal. Range Searching. Technical Report CS-1996-05, Duke University, Department of Computer Science, 1996.

    Google Scholar 

  2. John M. Airey, John H. Rohlf, and Jr Frederick P. Brooks. Towrads Image Realism with Interactive Update Rates in Complex Virtual Environments. In Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics 1990, pages 41–50, 1990.

    Google Scholar 

  3. Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, and José Soares. On Sparse Spanners of Weighted Graphs. Discrete & Computational Geometry, 9:81–100, 1993.

    Google Scholar 

  4. Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, and Michiel Smid. Euclidian Spanners: Short, Thin, and Lanky. In 27th Annual ACM Symposium on Theory of Computing, pages 489–498, 1995.

    Google Scholar 

  5. Bradford Chamberlain, Tony DeRose, Dani Lischinski, David Salesin, and John Snyder. Fast Rendering of Complex Environments Using a Spatial Hierarchy. In Proceedings of the Graphics Interface '96, 1996.

    Google Scholar 

  6. Bradfort Chamberlain, Tony DeRose, Dani Lischinski, David Salesin, and John Snyder. Fast Rendering of Complex Environments Using a Spatial Hierarchy. Technical Report UW-CSE-95-05-02, University of Washington, July 1995.

    Google Scholar 

  7. B. Chazelle and H. Edelsbrunner. Optimal Solutions for a Class of Point Retrieval Problems. Journal of Symbolic Computation, 1:47–56, 1985.

    Google Scholar 

  8. B. Chazelle and H. Edelsbrunner. Linear Space Data Structures for Two Types of Range Search. Discrete & Computational Geometry, 2:113–126, 1987.

    Google Scholar 

  9. James H. Clark. Hierarchical Geometric Models for Visible Surface Algorithms. Communications of the ACM, 19(10):547–554, October 1976.

    Google Scholar 

  10. Tony DeRose, Michael Lounsbery, and Joe Warren. Multiresolution Analysis of Arbitrary Topological Type. Technical Report 93-10-05, University of Washington, Seattle, WA, 98195, October 1993.

    Google Scholar 

  11. M. Dietzfelbinger and F. Meyer auf der Heide. Dynamic Hashing in Real Time. In Informatik: Festschrift zum 60. Geburtstag von Günter Hotz. Teubner, Stuttgart, 1992.

    Google Scholar 

  12. M. Dietzfelbinger, A. Karlin, F. Meyer auf der Heide, H. Rohnert, and R.E. Tarjan. Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM Journal on Computing, 23(4):748–761, 1994.

    Google Scholar 

  13. Matthias Eck, Tony DeRose, Tom Duchamp, Hugues Hoppe, Michael Lounsbery, and Werner Stuetzle. Multiresolution Analysis of Arbitrary Meshes. In Proceedings of the SIGGRAPH '95, pages 173–182, August 1995.

    Google Scholar 

  14. Carl Erikson. Polygonal Simplification: An Overview. Technical Report 96-016, University of North Carolina at Chapel Hill, Department of Computer Science, 1996.

    Google Scholar 

  15. Henry Fuchs, Zvi M. Kedem, and Bruce F. Naylor. On Visible Surface Generation by a Priori Tree Structures. In Computer Graphics, 1980.

    Google Scholar 

  16. Thomas A. Funkhouser and Carlo H. Sequin. Adaptive Display Algorithm for Interactive Frame Rates During Visualisation of Complex Virtual Environments. In Proceedings of the SIGGRAPH '93, pages 247–254, 1993.

    Google Scholar 

  17. Thomas A. Funkhouser, Carlo H. Sequin, and Seth J. Theller. Management of Large Amounts of Data in Interactive Building Walkthroughs. In Proceedings of the SIGGRAPH '91, pages 11–20, 1992.

    Google Scholar 

  18. Ned Greene, Michael Kass, and Gavin Miller. Hierarchical Z-Buffer Visibility. In Proceedings of the SIGGRAPH '93, pages 231–238, 1993.

    Google Scholar 

  19. J. Mark Keil and Carl A. Gutwin. Classes of Graphs Which Approximate the Complete Euclidean Graph. Discrete & Computational Geometry, 7:13–28, 1992.

    Google Scholar 

  20. Michael Lounsbery. Multiresolution analysis for surfaces of arbitrary topological type. PhD thesis, Dept. of Computer Science and Engineering, University of Washington, 1994.

    Google Scholar 

  21. David Luebke and Chris Georges. Portals and Mirrors: Simple, Fast Evaluation of Potentially Visible Sets. In Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics 1995. ACM Press, April 1995.

    Google Scholar 

  22. Paulo W. C. Maciel and Peter Shrirley. Visual Navigation of Large Environments Using Textured Clusters. In Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics 1995, 1995.

    Google Scholar 

  23. Jiří Matoušek. Geometric Range Searching. ACM Computing Surveys, 26:421–461, 1994.

    Google Scholar 

  24. C.A. Rogers. Covering a Sphere with Spheres. Mathematika, 10:157–164, 1963.

    Google Scholar 

  25. J. Ruppert and R. Seidel. Approximating the d-dimensional complete Euclidean graph. In 3rd Canadian Conference on Computational Geometry, pages 207–210, 1991.

    Google Scholar 

  26. Hanan Samet and Robert E. Webber. Hierarchical data structures and algorithms for computer graphics, part I. IEEE Computer Graphics and Applications, 8(3):48–68, May 1988.

    Google Scholar 

  27. Hanan Samet and Robert E. Webber. Hierarchical data structures and algorithms for computer graphics, part II. IEEE Computer Graphics and Applications, 8(4):59–75, July 1988.

    Google Scholar 

  28. Jonathan Mark Sewell. Managing Complex Models for Computer Graphics. PhD thesis, University of Cambridge, Queens' College, March 1996.

    Google Scholar 

  29. Jonathan Shade, Dani Lischinski, David H. Salesin, Tony DeRose, and John Snyder. Hierarchical Image Caching for Accelerated Walkthroughs of Complex Environments. In Proceedings of the SIGGRAPH '96, August 1996.

    Google Scholar 

  30. Seth J. Teller and Carlo H. Sequin. Visibility Preprocessing For Interactive Walkthroughs. In Proceedings of the SIGGRAPH '90, volume 25, pages 61–69, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Heinz Nixdorf Institute and Department of Computer Science, University of Paderborn, D-33095, Paderborn, Germany

    M. Fischer, F. Meyer auf der Heide & W. -B. Strothmann

Authors
  1. M. Fischer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Meyer auf der Heide
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. W. -B. Strothmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rainer Burkard Gerhard Woeginger

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fischer, M., Meyer auf der Heide, F., Strothmann, W.B. (1997). Dynamic data structures for realtime management of large geometric scenes. In: Burkard, R., Woeginger, G. (eds) Algorithms — ESA '97. ESA 1997. Lecture Notes in Computer Science, vol 1284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63397-9_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-63397-9_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63397-6

  • Online ISBN: 978-3-540-69536-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation