Visibility preprocessing for interactive walkthroughs

Proceedings of the 18th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1991

Volumn , Issue , 1991, Pages 61-69

  Teller, Selh J ^a   Sequin, Carlo H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Architectural simulation; Linear progmmming. superset visibility

Indexed keywords

CELLS; INTERACTIVE COMPUTER GRAPHICS; RENDERING (COMPUTER GRAPHICS); THREE DIMENSIONAL COMPUTER GRAPHICS; VISIBILITY;

ADJACENCY GRAPHS; ARCHITECTURAL MODELS; ARCHITECTURAL SIMULATION; GRAPHICS PIPELINE; HIDDEN SURFACE REMOVAL; INTERACTIVE FRAME RATES; INTERACTIVE WALKTHROUGH; OPAQUE SURFACES;

CYTOLOGY;

EID: 84904535957     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/122718.122725     Document Type: Conference Paper

References (22)

1. John M. Airey. Increasing Update Rates in the Building Walkthrough System with Automatic Model-Space Subdivision and Potentially Visible Set Calculations. PhD thesis, UNC Chapel Hill. 1990.
2. John M. Airey, John H. Rohlf, and Frederick P. Brooks Jr. Towards image realism with interactive update rates in complex virtual building environments. ACM SIGGRAPH Special Issue on 1990 Symposium on Interactive 3D Graphics, 24(2 ):41 -50, 1990.
3. Kurt Akeley. The Silicon Graphics 4D/240GTX superwork- station. IEEE Computer Graphics and Applications. 9(4): 239-246, 1989.
4. J.L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18:509-517. 1975.
5. B. Chazelle and L.J. Guibas. Visibility and intersection problems in plane geometry. In Proc. 1st ACM Symposium on Computational Geometry, pages 135-146, 1985.
6. Frank C. Crow. Shadow algorithms for computer graphics. Computer Graphics (Proc. SIGGRAPH'77). 11 (2):242-248. 1977.
7. David P. Dobkin and Diane L. Souvaine. Detecting the intersection of convex objects in the plane. Technical Report No. 89-9. DIMACS, 1989.
8. H. Fuchs, Z. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. Computer Graphics (Proc. SIGGRAPH'80). 14(3): 124-133. July 1980.
9. Akira Fujimoto and Kansei Iwata. Accelerated ray tracing. In Computer Graphics: Visual Technology and Art (Proc. Computer Graphics Tokyo). pages 41-65. 1985.
10. Benjamin Garlick, Daniel R. Baum, and James M. Winget. Interactive viewing of large geometric databases using multiprocessor graphics workstations. In SIGGRAPH'90 Course Notes (Parallel Algorithms and Architectures for 3D Image Generation). August 1990.
11. Andrew S. Glassner. Space subdivision for fast ray tracing. IEEE Computer Graphics and Applications. 4( 10): 15-22, October 1984.
12. John E. Hershberger. Efficient Algorithms for Shortest Path and Visibility Problems. PhD thesis. Stanford University. June 1987.
13. Michael E. Hohmeyer and Seth J. Teller. Stabbing isothetic rectangles and boxes in ()(lig n) time (in preparation).
14. David Kirk and Douglas Voorhies. The rendering architecture of the DNIOOOO VS. Computer Graphics I Proc. SIGGRAPH 90). 24(4):299-307, August 1990.
15. N.Megiddo. Linear-time algorithms for linear programming in and related problems. SIAM Journal Computing. 12:759-776. 1983.
16. Joseph O' Rourke. Art Gallery Theorems and Algorithms. Oxford University Press. 1987.
17. Michael S. Paterson and F. Frances Yao. Efficient binary space partitions for hidden-surface removal and solid modeling. Discrete and Computational Geometry. 5(5):485-503, 1990.
18. W. H. Plantinga and C. R. Dyer. An algorithm for constructing the aspect graph. In Proc. IEEE Symp. Foundations of Computer Science, pages 123-131, 1986.
19. Raimund Seidel. Linear programming and convex hulls made easy. In Proc. 6 ACM Sympo sium on Computational Geometry. pages 211-215. 1990.
20. Michael Ian Shamos and Franco P. Preparata. Computational Geometry: An Introduction. Springer-Verlag. 1985.
21. 2) time (in preparation).
22. Gert Vegter. The visibility diagram: A data structure for visibility problems and motion planning. In Proc. 2' Scandinavian Workshop on Algorithm Theory, pages 97-110. 1990.