Abstract
Computer generated holography is an extremely demanding and complex task when it comes to providing realistic reconstructions with full parallax, occlusion, and shadowing. We present an algorithm designed for data-parallel computing on modern graphics processing units to alleviate the computational burden. We apply Gaussian interpolation to create a continuous surface representation from discrete input object points. The algorithm maintains a potential occluder list for each individual hologram plane sample to keep the number of visibility tests to a minimum. We experimented with two approximations that simplify and accelerate occlusion computation. It is observed that letting several neighboring hologram plane samples share visibility information on object points leads to significantly faster computation without causing noticeable artifacts in the reconstructed images. Computing a reduced sample set via nonuniform sampling is also found to be an effective acceleration technique.
© 2009 Optical Society of America
Full Article | PDF ArticleMore Like This
Rick H.-Y. Chen and Timothy D. Wilkinson
Appl. Opt. 48(21) 4246-4255 (2009)
Hoonjong Kang, Fahri Yaraş, and Levent Onural
Appl. Opt. 48(34) H137-H143 (2009)
Athanasia Symeonidou, David Blinder, and Peter Schelkens
Opt. Express 26(8) 10282-10298 (2018)