The computability and complexity of optical beam tracing

Published

Journal Article

The ray-tracing problem is considered for optical systems consisting of a set of refractive or reflective surfaces. It is assumed that the position and the tangent of the incident angle of the initial light ray are rational. The computability and complexity of the ray-tracing problems are investigated for various optical models. The results show that, depending on the optical model, ray tracing is sometimes undecidable, sometimes PSPACE-hard, and sometimes in PSPACE.

Duke Authors

Cited Authors

  • Reif, JH; Tygar, JD; Yoshida, A

Published Date

  • January 1, 1991

Published In

Volume / Issue

  • 27 / 1 pt 1

Start / End Page

  • 106 - 114

International Standard Serial Number (ISSN)

  • 0093-9994

Citation Source

  • Scopus