References
- Airey et al., 1990
-
Airey, J. M., Rohlf, J. H., and Brooks, Jr., F. P. (1990).
Towards image realism with interactive update rates in complex
virtual building environments.
In Riesenfeld, R. and Séquin, C., editors, Computer Graphics
(1990 Symposium on Interactive 3D Graphics), pages 41-50.
- Brooks Jr et al., 1992
-
Brooks Jr, F. P., Airey, J., Alspaugh, J., Bell, A., Brown, R., Hill, C.,
Nimscheck, U., Rheingans, P., Rohlf, J., Smith, D., Turner, D., Varshney, A.,
Wang, Y., Weber, H., and Yuan, X. (1992).
Six generations of building walkthrough: Final technical report to
the national science foundation.
Technical Report TR92-026, Department of Computer Science, University
of North Carolina.
[Postscript document].
- Cazals et al., 1995
-
Cazals, F., Drettakis, G., and Puech, C. (1995).
Filtering, clustering and hierarchy construction: a new solution for
ray tracing very complex environments.
In Eurographics'95.
[Postscript document].
Clark, 1976-
Clark, J. H. (1976).
Hierarchical geometric models for visible surface algorithms.
Communications of the ACM, 19:547-554.
-
Coorg and Teller, 1996a
-
Coorg, S. and Teller, S. (1996a).
A spatially and temporally coherent object space visibility
algorithm.
Technical Report TM-546, Department of Computer Graphics, MIT.
[Postscript document].
- Coorg and Teller, 1996b
-
Coorg, S. and Teller, S. (1996b).
Temporally coherent conservative visibility.
In Proceedings of the Twelfth Annual ACM Symposium on
Computational Geometry, Philadelphia, PA.
[Postscript document].
- Durand et al., 1996
-
Durand, F., Drettakis, G., and Puech, C. (1996).
The 3D Visibility Complex, a new approach to the problems of
accurate visibility.
In Eurographics Workshop on Rendering.
[Postscript document].
- Durand et al., 1997
-
Durand, F., Drettakis, G., and Puech, C. (1997).
The visibility skeleton: A powerful and efficient multi-purpose global visibility tool.
In Computer Graphics (Proceedings of SIGGRAPH'97).
[PDF document]
- Fuchs et al., 1979
-
Fuchs, H., Kedem, Z. M., and Naylor, B. (1979).
Predetermining visibility priority in 3-D scenes (preliminary
report). Volume 13, pages 175-181.
- Fuchs et al., 1980
-
Fuchs, H., Kedem, Z. M., and Naylor, B. F. (1980).
On visible surface generation by a priori tree structures.
volume 14, pages 124-133.
- Funkhouser, 1993
-
Funkhouser, T. A. (1993).
Database and display algorithms for interactive visualization of
architectural models.
Phd Thesis EECS Computer Science Division, University of California, Berkeley.
Also available as Technical Report UCB//CSD-93-771.
[Postscript document |
abstract].
- Georges, 1995
-
Georges, C. (1995).
Obscuration culling on parallel graphics architectures.
Technical Report TR95-017, Department of Computer Science, University
of N. Carolina, Chapel Hill.
[Postscript document].
-
Greene et al., 1993
-
Greene, N., Kass, M., and Miller, G. (1993).
Hierarchical Z-buffer visibility.
In Valastyan, L. and Walsh, L., editors, Proceedings of the
Annual Conference on Computer Graphics, pages 231-238. ACM Press.
- Krishnan and Manocha, 1994
-
Krishnan, S. and Manocha, D. (1994).
Global visibility and hidden surface algorithms for free form
surfaces.
Technical Report TR94-063, Department of Computer Science, University
of N. Carolina, Chapel Hill.
[Postscript document].
- Kumar and Manocha, 1996
-
Kumar, S. and Manocha, D. (1996).
Hierarchical visibility culling for spline models.
In Graphics Interface, Totonto, Canada.
[Postscript document].
- Kumar et al., 1995
-
Kumar, S., Manocha, D., and Lastra, A. (1995).
Interactive display of large-scale NURBS models.
In Hanrahan, P. and Winget, J., editors, 1995 Symposium on
Interactive 3D Graphics, pages 51-58. ACM SIGGRAPH.
[Postscript document].
- Kumar et al., 1996
-
Kumar, S., Manocha, D., Garret, W., and Lin, M. (1996).
Hierarchical backface computation.
In Proceedings of Eurographics'96.
[Postscript
document].
-
Luebke and Georges, 1995
-
Luebke, D. and Georges, C. (1995).
Portals and mirrors: Simple, fast evaluation of potentially visible
sets.
In Hanrahan, P. and Winget, J., editors, 1995 Symposium on
Interactive 3D Graphics, pages 105-106. ACM SIGGRAPH.
[Postscript document |
more
information ].
- Naylor, 1993
-
Naylor, B. (1993). Constructing good partition trees.
In Proceedings of Graphics Interface '93, pages 181-191,
Toronto, Ontario, Canada. Canadian Information Processing Society.
- Naylor, 1992a
-
Naylor, B. F. (1992a). Interactive solid geometry via partitioning trees.
In Proceedings of Graphics Interface '92, pages 11-18.
- Naylor, 1992b
-
Naylor, B. F. (1992b). Partitioning tree image representation and generation
from 3D geometric models.
In Proceedings of Graphics Interface '92, pages 201-212.
- Naylor, 1995
-
Naylor, B. F. (1995). Interactive playing with large synthetic environments.
In Hanrahan, P. and Winget, J., editors, 1995 Symposium on
Interactive 3D Graphics, pages 107-108. ACM SIGGRAPH.
ISBN 0-89791-736-7.
- Orti et al., 1996
-
Orti, R., Rivière, S., Durand, F., and Puech, C. (1996).
Radiosity for dynamic scenes in flatland with the visibility complex.
In Proceedings of Eurographics'96.
[Postscript document].
- Plantinga, 1993
-
Plantinga, H. (1993).
Conservative visibility preprocessing for efficient walkthroughs of
3D scenes.
In Proceedings of Graphics Interface '93, pages 166-173,
Toronto, Ontario, Canada. Canadian Information Processing Society.
- Plantinga and Dyer, 1987
-
Plantinga, W. H. and Dyer, C. R. (1987).
Visibility, occlusion and the aspect graph.
Technical Report TR 736, Computer Sciences Department, University of
Wisconsin-Madison.
- Plantinga and Dyer, 1990
-
Plantinga, W. H. and Dyer, C. R. (1990).
Visibility, occlusion, and the aspect graph.
International Journal of Computer Vision, 5(2):137-160.
- Pocchiola and Vegler, 1995
-
Pocchiola, M. and Vegler, C. (1995).
Computing the visibility graph via pseudo-triangulation.
In Proceedings of the 11th Annual Symposium on Computational
Geometry, pages 248-257. ACM Press.
[Postscript document].
-
Pocchiola and Vegter, 1993
-
Pocchiola, M. and Vegter, G. (1993).
The visibility complex.
In ACM-SIGGRAPH, A.-S., editor, Proceedings of the 9th Annual
Symposium on Computational Geometry (SCG '93), pages 328-337. ACM Press.
[Postscript document].
-
Pocchiola and Vegter, 1994
-
Pocchiola, M. and Vegter, G. (1994).
Minimal tangent visibility graphs.
In Proceedings of the 6th Canadian Conference on Computational
Geometry, pages 24-29. University of Saskatchewan.
- Regan and Pose, 1994
-
Regan, M. and Pose, R. (1994).
Priority rendering with a virtual reality address recalculation
pipeline.
In Glassner, A., editor, Proceedings of SIGGRAPH '94 (Orlando,
Florida, July 24-29, 1994), Computer Graphics Proceedings, Annual
Conference Series, pages 155-162. ACM SIGGRAPH, ACM Press.
ISBN 0-89791-667-0.
-
Schaufler and Stürzlinger, 1996
-
Schaufler, G. and Stürzlinger, W. (1996).
A three dimensional image cache for virtual reality.
In Proceedings of Eurographics'96.
[Postscript document].
-
Shade et al., 1996
-
Shade, J., Lischinski, D., Salesin, D. H., DeRose, T., and Snyder, J. (1996).
Hierarchical Image Caching for Accelerated Walkthroughs of
Complex Environments.
Technical Report UW-CSE-96-01-06, Department of Computer Science and
Engineering, University of Washington.
[Postscript document].
-
Sillion and Drettakis, 1995
-
Sillion, F. and Drettakis, G. (1995).
Feature-based control of visibility error: A multiresolution
clustering algorithm for global illumination.
In Computer Graphics Proceedings, Annual Conference Series: SIGGRAPH '95 (Los Angeles, CA), pages 145-152. ACM SIGGRAPH, New York.
[Postscript document].
- Teller et al., 1994
-
Teller, S., Fowler, C., Funkhouser, T., and Hanrahan, P. (1994).
Partitioning and ordering large radiosity computations.
In Glassner, A., editor, Proceedings of SIGGRAPH '94 (Orlando,
Florida, July 24-29, 1994), Computer Graphics Proceedings, Annual
Conference Series, pages 443-450. ACM SIGGRAPH, ACM Press.
ISBN 0-89791-667-0.
[Postscript document].
-
Teller and Hanrahan, 1993
-
Teller, S. and Hanrahan, P. (1993).
Global visibility algorithms for illumination computations.
In Proc. SIGGRAPH '93, pages 239-246.
[Postscript document].
-
Teller, 1992
-
Teller, S. J. (1992).
Visibility Computations in Densely Occluded Polyhedral
Environments.
PhD thesis, Dept. of Computer Science, University of California,
Berkeley.
Also available as Technical Report UCB//CSD-92-708.
[Postscript document].
-
Teller and Séquin, 1991
-
Teller, S. J. and Séquin, C. H. (1991).
Visibility preprocessing for interactive walkthroughs.
Computer Graphics (SIGGRAPH '91 Proceedings), pages 61-69.
- Teller and Séquin, 1992
-
Teller, S. J. and Séquin, C. H. (1992).
Visibility computations in polyhedral environments.
Technical Report UCB//CSD-92-680, EECS Computer Science Division,
University of California, Berkeley.
- Yagel and Ray, 1995
-
Yagel, R. and Ray, W. (1995). Visibility computation for efficient
walkthrough of complex environments.
Presence: Teleoperators and Virtual Environments, 5(1).
[Postscript document].
- Zhang et al., 1997
-
Zhang, H., Manocha, D., Hudson, T., and Hoff, K. (1997).
Visibility culling using hierarchical occlusion maps.
Technical Report TR97-004, Department of Computer Science, University
of N. Carolina, Chapel Hill. To appear in SIGGRAPH'97.
[Postscript document]
-
You may also want to get the Citation Information
for these entries (in BibTeX format).
