Optimized occlusion culling using five-dimensional subdivision

Craig Gotsman, Oded Sudarsky, Jeffrey A. Fayman

Research output: Contribution to journalArticlepeer-review

21 Scopus citations


We describe an algorithm for occlusion culling by visibility preprocessing. The algorithm intelligently partitions the five-dimensional viewing parameter space using a 5D tree (a k-D tree with k = 5), such that each leaf of the tree contains a reference to a subset of the n scene objects. The visibility of each of the objects is determined using a ray-casting procedure. We show how to minimize the number of rays cast in order to achieve a reliable estimate of the visibility relations, and how to efficiently code the resulting 5D tree.

Original languageEnglish (US)
Pages (from-to)645-654
Number of pages10
JournalComputers and Graphics (Pergamon)
Issue number5
StatePublished - Oct 1999
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • General Engineering
  • Human-Computer Interaction
  • Computer Graphics and Computer-Aided Design


  • 5D spatial subdivision
  • K-D trees
  • Occlusion culling


Dive into the research topics of 'Optimized occlusion culling using five-dimensional subdivision'. Together they form a unique fingerprint.

Cite this