Visibility Computations in Polyhedral Environments

  • Authors:
  • Seth J Teller;Carlo H. Sequin

  • Affiliations:
  • -;-

  • Venue:
  • Visibility Computations in Polyhedral Environments
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

The cell-to-cell visibility preprocessing and query algorithms for 2D axial floor-plans (presented at SIGGRAPH ''91) have been extended to cell-to-object visibility in 3D polyhedral environments, and an efficient implementation for 3D axial environments is demonstrated on a fully furnished architectural floor model with 250,000 polygons. The building is subdivided along the major walls into cells, connected through transparent portals. During preprocessing, cell-to-cell visibility is established for all cell pairs connected by at least one sight line through the intervening portals. Even for a source cell containing a generalized observer, often only a small portion of other cells is visible. Only objects whose bounding boxes intersect these "visible volumes"become part of the cell-to-object visibility set of the source cell. In the real-time walk-through simulation, cell-to-object visibility is further pruned with the view frustum from the observer''s current position, and only the remaining objects, which still form an uncompromised superset of the truly visible polygons, are sent to the renderer. In our architectural floor model, this process removed on average about 95% of all polygons, and accelerated rendering speed by about a factor of seventeen.