Visibility Transition Planning for Dynamic Camera Control

  • Thomas Oskam
  • Robert W. Sumner
  • Nils Thuerey
  • Markus Gross
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6459)

Abstract

We present a real-time camera control system that uses a global planning algorithm to compute large, occlusion free camera paths through complex environments. The algorithm incorporates the visibility of a focus point into the search strategy, so that a path is chosen along which the focus target will be in view. The efficiency of our algorithm comes from a visibility-aware roadmap data structure that permits the precomputation of a coarse representation of all collision-free paths through an environment, together with an estimate of the pair-wise visibility between all portions of the scene. Our runtime system executes a path planning algorithm using the precomputed roadmap values to find a coarse path, and then refines the path using a sequence of occlusion maps computed on-the-fly. An iterative smoothing algorithm, together with a physically-based camera model, ensures that the path followed by the camera is smooth in both space and time. Our global planning strategy on the visibility-aware roadmap enables large-scale camera transitions as well as a local third-person camera module that follows a player and avoids obstructed viewpoints. The data structure itself adapts at run-time to dynamic occluders that move in an environment. We demonstrate these capabilities in several realistic game environments.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Thomas Oskam
    • 1
  • Robert W. Sumner
    • 2
  • Nils Thuerey
    • 1
  • Markus Gross
    • 1
    • 2
  1. 1.ETH ZurichSwitzerland
  2. 2.Disney Research ZurichSwitzerland

Personalised recommendations