一个圆盘覆盖问题及其在光学干涉测量中的应用
A disk-covering problem with application in optical interferometry
摘要:
给定平面上的一个圆盘O,称为目标,我们想找到n个小圆盘P_1,...,P_n称为瞳孔使得$\bigcup_{i,j=1}^n P_i \ominus P_j \supseteq O$,其中$\ominus$表示Minkowski差分算子,同时最小化瞳孔的数目、瞳孔的半径和或瞳孔的总面积。这个问题的动机是通过所谓的光学孔径合成从几个较小的望远镜建造非常大的望远镜。在本文中,我们提供了精确的,近似的和启发式的解决方案的几个变化的问题。
英文摘要:
Given a disk O in the plane called the objective, we want to find n small disks P_1,...,P_n called the pupils such that $\bigcup_{i,j=1}^n P_i \ominus P_j \supseteq O$, where $\ominus$ denotes the Minkowski difference operator, while minimizing the number of pupils, the sum of the radii or the total area of the pupils. This problem is motivated by the construction of very large telescopes from several smaller ones by so-called Optical Aperture Synthesis. In this paper, we provide exact, approximate and heuristic solutions to several variations of the problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。