## Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

# Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

 Mittagsseminar Talk Information

Date and Time: Tuesday, August 07, 2007, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Trung Nguyễn (INRIA Sophia Antipolis Research Unit, France)

## A disk-covering problem with application in optical interferometry

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. I will present exact, approximate and heuristic solutions to several variations of the problem.

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login