Conservative Visibility Preprocessing for Complex Virtual Environments

  • Authors:
  • Jaeho Kim;Kwangyun Wohn

  • Affiliations:
  • -;-

  • Venue:
  • VSMM '01 Proceedings of the Seventh International Conference on Virtual Systems and Multimedia (VSMM'01)
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new approach to visibility culling. We propose a conservativevisibility preprocessing method for complex virtual environments. The proposed method dealswith general 3D graphical models and invisible polygons jointly blocked by multipleoccluders. The proposed method decomposes volume visibility from the predefined volumeinto the area visibility from rectangles surrounding predefined volume. Then, to handle thevolume visibility, we solve the area visibility problem. The proposed method expresses areavisibility information into 3D space and keeps it with a BSP(binary space partitioning) tree.Area visibility information is image plane information for every viewpoints within the viewrectangle. To express the area visibility information in 3D space, we present modified ghostpolygon and method reducing dependency between axes in view rectangle. The proposedmethod has been tested on several large-scale urban scenes, and has shown its effectiveness.