Broadband antihole photon sieve telescope.

نویسندگان

  • Geoff Andersen
  • Drew Tullson
چکیده

A broadband-corrected optical telescope has been constructed from a photon sieve with five million holes. Through careful optimization of hole size, this "antihole" sieve has holes centered on the dark underlying Fresnel zones. The diffraction-limited performance of a 1 m focal-length, f/10 element is demonstrated with a view toward constructing large lightweight telescopes for space applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large optical photon sieve.

A photon sieve with 10(7) holes has been constructed for operation at optical wavelengths. Details of the design, fabrication, and performance of this device are presented. The 1 m focal-length, 0.1 m diameter element is diffraction limited over a significant bandwidth and has a moderate field of view.

متن کامل

Focusing analysis of the pinhole photon sieve: individual far-field model.

Recently, a new class of diffractive optical element called a photon sieve, which consists of a great number of pinholes, was developed for the focusing and imaging of soft x rays. In terms of the closed-form formula for the far field of individual pinholes and the linear superposition principle, we present a simple yet accurate analytical model for the focusing of the pinhole photon sieve. Thi...

متن کامل

A characterization of diameter-2-critical graphs with no antihole of length four

A graph G is diameter-2-critical if its diameter is two and the deletion of any edge increases the diameter. In this paper we characterize the diameter-2-critical graphs with no antihole of length four, that is, the diameter-2-critical graphs whose complements have no induced 4-cycle. Murty and Simon conjectured that the number of edges in a diameter-2-critical graph of order n is at most n2/4 ...

متن کامل

K4-free graphs with no odd holes

All K4-free graphs with no odd hole and no odd antihole are three-colourable, but what about K4free graphs with no odd hole? They are not necessarily three-colourable, but we prove a conjecture of Ding that they are all four-colourable. This is a consequence of a decomposition theorem for such graphs; we prove that every such graph either has no odd antihole, or belongs to one of two explicitly...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied optics

دوره 46 18  شماره 

صفحات  -

تاریخ انتشار 2007