The geometry of beam tracing

  • Authors:
  • Norm Dadoun;David G. Kirkpatrick;John P. Walsh

  • Affiliations:
  • University of British Columbia, Vancouver, British Columbia;itish Columbia;Artec Consultants Inc., New York City, New York

  • Venue:
  • SCG '85 Proceedings of the first annual symposium on Computational geometry
  • Year:
  • 1985

Quantified Score

Hi-index 0.01

Visualization

Abstract

A solution to the hidden surface elimination problem called Beam Tracing is described. Beam tracing is related to ray tracing but uses spatial coherence within the scene, and area coherence within the image to batch computations. Beam tracing is an object space solution to the hidden surface problem.Beam tracing is formulated in terms of its principal subprocesses: intersection, sorting, and clipping. A Hierarchical Scene Representation is proposed. This incorporates the space decomposition idea of the BSP tree [Fuchs, Kedem and Naylor, 80] along with the convex polytope intersection detection technique of [Dobkin and Kirkpatrick, 83] to interleave and efficiently solve the intersection and sorting subproblems of beam tracing.