Instant Visibility

Peter Wonka, Michael Wimmer, François Sillion
Instant Visibility
Computer Graphics Forum, 20(3):411-421, September 2001. [Paper]

Information

  • Publication Type: Journal Paper with Conference Talk
  • Workgroup(s)/Project(s):
  • Date: September 2001
  • Date (from): 5. September 2001
  • Date (to): 7. September 2001
  • Event: EUROGRAPHICS 2001
  • ISSN: 0167-7055
  • Journal: Computer Graphics Forum
  • Lecturer:
  • Location: Manchester, UK
  • Note: Günther Enderle [Best Paper] Award, Best Student Paper Award. A. Chalmers and T.-M. Rhyne (eds.), Proceedings EUROGRAPHICS 2001
  • Number: 3
  • Pages (from): 411
  • Pages (to): 421
  • Volume: 20

Abstract

We present an online occlusion culling system which computes visibility in parallel to the rendering pipeline. We show how to use point visibility algorithms to quickly calculate a tight potentially visible set (PVS) which is valid for several frames, by shrinking the occluders used in visibility calculations by an adequate amount. These visibility calculations can be performed on a visibility server, possibly a distinct computer communicating with the display host over a local network. The resulting system essentially combines the advantages of online visibility processing and region-based visibility calculations, allowing asynchronous processing of visibility and display operations. We analyze two different types of hardware-based point visibility algorithms and address the problem of bounded calculation time which is the basis for true real-time behavior. Our results show reliable, sustained 60 Hz performance in a walkthrough with an urban environment of nearly 2 million polygons, and a terrain flyover.

Additional Files and Images

Additional images and videos

Additional files

Weblinks

No further information available.

BibTeX

@article{Wonka-2001-Ins,
  title =      "Instant Visibility",
  author =     "Peter Wonka and Michael Wimmer and Fran\c{c}ois Sillion",
  year =       "2001",
  abstract =   "We present an online occlusion culling system which computes
               visibility in parallel to the rendering pipeline. We show
               how to use point visibility algorithms to quickly calculate
               a tight potentially visible set (PVS) which is valid for
               several frames, by shrinking the occluders used in
               visibility calculations by an adequate amount. These
               visibility calculations can be performed on a visibility
               server, possibly a distinct computer communicating with the
               display host over a local network. The resulting system
               essentially combines the advantages of online visibility
               processing and region-based visibility calculations,
               allowing asynchronous processing of visibility and display
               operations. We analyze two different types of hardware-based
               point visibility algorithms and address the problem of
               bounded calculation time which is the basis for true
               real-time behavior. Our results show reliable, sustained 60
               Hz performance in a walkthrough with an urban environment of
               nearly 2 million polygons, and a terrain flyover.",
  month =      sep,
  issn =       "0167-7055",
  journal =    "Computer Graphics Forum",
  note =       "G\"{u}nther Enderle [Best Paper] Award, Best Student Paper
               Award. A. Chalmers and T.-M. Rhyne (eds.), Proceedings
               EUROGRAPHICS 2001",
  number =     "3",
  volume =     "20",
  pages =      "411--421",
  URL =        "/research/publications/2001/Wonka-2001-Ins/",
}