Add to BibSonomy
Abstract
We present a method of rapidly producing computer-generated holograms that exhibit geometric occlusion in the reconstructed image. Conceptually, a bundle of rays is shot from every hologram sample into the object volume. We use z buffering to find the nearest intersecting object point for every ray and add its complex field contribution to the corresponding hologram sample. Each hologram sample belongs to an independent operation, allowing us to exploit the parallel computing capability of modern programmable graphics processing units (GPUs). Unlike algorithms that use points or planar segments as the basis for constructing the hologram, our algorithm’s complexity is dependent on fixed system parameters, such as the number of ray-casting operations, and can therefore handle complicated models more efficiently. The finite number of hologram pixels is, in effect, a windowing function, and from analyzing the Wigner distribution function of windowed free-space transfer function we find an upper limit on the cone angle of the ray bundle. Experimentally, we found that an angular sampling distance of for a cone angle produces acceptable reconstruction quality.
© 2009 Optical Society of America
Full Article | PDF ArticleMore Like This
Rick H.-Y. Chen and Timothy D. Wilkinson
Appl. Opt. 48(36) 6841-6850 (2009)
Hao Zhang, Liangcai Cao, and Guofan Jin
Appl. Opt. 56(13) F138-F143 (2017)
Antonin Gilles, Patrick Gioia, Rémi Cozot, and Luce Morin
Appl. Opt. 55(20) 5459-5470 (2016)