A disk-covering problem with application in optical interferometry

Computer Science – Computational Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

10 pages, 8 figures

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A disk-covering problem with application in optical interferometry does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A disk-covering problem with application in optical interferometry, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A disk-covering problem with application in optical interferometry will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-717452

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.