A disk-covering problem with application in optical interferometry
| dc.creator | Nguyen, Trung | |
| dc.creator | Boissonnat, Jean-Daniel | |
| dc.creator | Falzon, Frederic | |
| dc.creator | Knauer, Christian | |
| dc.date | 2006-12-05 | |
| dc.date.accessioned | 2026-07-07T07:31:49Z | |
| dc.date.available | 2026-07-07T07:31:49Z | |
| dc.description | 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. | |
| dc.description | 10 pages, 8 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0612026 | |
| dc.identifier | http://arxiv.org/abs/cs/0612026 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/118893 | |
| dc.subject | Computational Geometry | |
| dc.subject | I.3.5 | |
| dc.title | A disk-covering problem with application in optical interferometry | |
| dc.type | text |