Dynamic data structures for realtime management of large geometric scenes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1284, Issue , 1997, Pages 157-170

  Fischer, M ^a   Meyer auf der Heide, F ^a   Strothmann, W B ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANIMATION; CONVOLUTIONAL CODES; DATA STRUCTURES; RENDERING (COMPUTER GRAPHICS);

ANIMATION SYSTEMS; COMPUTATION POWER; DYNAMIC DATA STRUCTURE; HIGHER DIMENSIONS; INSERTIONS AND DELETIONS; REAL TIME REQUIREMENT; REAL-TIME MANAGEMENT; RENDERING HARDWARE;

INFORMATION MANAGEMENT;

EID: 21744431817     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63397-9_13     Document Type: Conference Paper

References (30)

1. Pankaj K. Agarwal. Range Searching. Technical Report CS-1996-05, Duke University, Department of Computer Science, 1996.
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.
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.
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.
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.
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.
7. B. Chazelle and H. Edelsbrunner. Optimal Solutions for a Class of Point Retrieval Problems. Journal of Symbolic Computation, 1:47-56, 1985.
8. B. Chazelle and H. Edelsbrunner. Linear Space Data Structures for Two Types of Range Search. Discrete & Computational Geometry, 2:113-126, 1987.
9. James H. Clark. Hierarchical Geometric Models for Visible Surface Algorithms. Communications of the ACM, 19(10):547-554, October 1976.
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.
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.
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.
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.
14. Carl Erikson. Polygonal Simplification: An Overview. Technical Report 96-016, University of North Carolina at Chapel Hill, Department of Computer Science, 1996.
15. Henry Fuchs, Zvi M. Kedem, and Bruce F. Naylor. On Visible Surface Generation by a Priori Tree Structures. In Computer Graphics, 1980.
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.
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.
18. Ned Greene, Michael Kass, and Gavin Miller. Hierarchical Z-Buffer Visibility. In Proceedings of the SIGGRAPH '93, pages 231-238, 1993.
19. J. Mark Keil and Carl A. Gutwin. Classes of Graphs Which Approximate the Complete Euclidian Graph. Discrete & Computational Geometry, 7:13-28, 1992.
20. Michael Lounsbery. Multiresolution analysis for surfaces of arbitrary topological type. PhD thesis, Dept, of Computer Science and Engineering, University of Washington, 1994.
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.
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.
23. Jiří Matoušek. Geometric Range Searching. ACM Computing Surveys, 26:421-461, 1994.
24. C.A. Rogers. Covering a Sphere with Spheres. Mathematika, 10:157-164, 1963.
25. J. Ruppert and R. Seidel. Approximating the d-dimensional complete Euclidean graph. In 3rd Canadian Conference on Computational Geometry, pages 207-210, 1991.
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.
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.
28. Jonathan Mark Sewell. Managing Complex Models for Computer Graphics. PhD thesis, University of Cambridge, Queens’ College, March 1996.
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.
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.