作者: Jean-Daniel Boissonnat , Christian Knauer , Trung Nguyen , Frédéric Falzon
DOI:
关键词: Interferometry 、 Heuristic (computer science) 、 Plane (geometry) 、 Operator (computer programming) 、 Minkowski space 、 Geometry 、 Aperture synthesis 、 Discrete mathematics 、 Mathematics
摘要: Given a disk O in the plane called objective, we want to nd n small disks P1; : ; Pn pupils such that S n=1 Pi Pj O, where denotes Minkowski dierence operator, while minimizing number of pupils, sum radii or total area pupils. This problem is motivated by construction very large telescopes from several smaller ones so-called Optical Aperture Synthesis. In this paper, provide exact, approximate and heuristic solutions variations problem.