Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] John Fitch,et al. Course notes , 1975, SIGS.
[3] James H. Clark,et al. Hierarchical geometric models for visible surface algorithms , 1976, CACM.
[4] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[5] Jarek Rossignac,et al. Multi-resolution 3D approximations for rendering complex scenes , 1993, Modeling in Computer Graphics.
[6] Edwin Blake,et al. A Metric for Computing Adaptive Detail in Animated Scenes Using Object-Oriented Programming , 1987, Eurographics.
[7] Carlo H. Séquin,et al. Visibility preprocessing for interactive walkthroughs , 1991, SIGGRAPH.
[8] Carlo H. Séquin,et al. Management of large amounts of data in interactive building walkthroughs , 1992, I3D '92.
[9] Bruce J. Schachter. Computer Image Generation , 1983 .
[10] Seth Teller,et al. Visibility Computations in Densely Occluded Polyhedral Environments , 1992 .
[11] T. Ibaraki,et al. THE MULTIPLE-CHOICE KNAPSACK PROBLEM , 1978 .
[12] Frederick P. Brooks,et al. Walkthrough—a dynamic graphics system for simulating virtual buildings , 1987, I3D '86.
[14] Frederick P. Brooks,et al. Towards image realism with interactive update rates in complex virtual building environments , 1990, I3D '90.