English
Related papers

Related papers: A disk-covering problem with application in optica…

200 papers

We give exact and approximation algorithms for two-center problems when the input is a set $\mathcal{D}$ of disks in the plane. We first study the problem of finding two smallest congruent disks such that each disk in $\mathcal{D}$…

Computational Geometry · Computer Science 2012-01-06 Hee-Kap Ahn , Sang-Sub Kim , Christian Knauer , Lena Schlipf , Chan-Su Shin , Antoine Vigneron

Given a set $P$ of $n$ points and a set $S$ of $m$ weighted disks in the plane, the disk coverage problem asks for a subset of disks of minimum total weight that cover all points of $P$. The problem is NP-hard. In this paper, we consider a…

Computational Geometry · Computer Science 2021-05-03 Logan Pedersen , Haitao Wang

Interest in pupil-remapping interferometry, in which a single telescope pupil is fragmented and recombined using fiber optic technologies, has been growing among a number of groups. As a logical extrapolation from several highly successful…

Given a set $P$ of $n$ points and a set $S$ of $m$ disks in the plane, the disk coverage problem asks for a smallest subset of disks that together cover all points of $P$. The problem is NP-hard. In this paper, we consider a line-separable…

Computational Geometry · Computer Science 2024-02-06 Gang Liu , Haitao Wang

We consider variants of the following multi-covering problem with disks. We are given two point sets $Y$ (servers) and $X$ (clients) in the plane, a coverage function $\kappa :X \rightarrow \mathcal{N}$, and a constant $\alpha \geq 1$.…

Computational Geometry · Computer Science 2014-07-23 Santanu Bhowmick , Kasturi Varadarajan , Shi-Ke Xue

The study of Young Stellar Objects (YSOs) is one of the most exciting topics that can be undertaken by long baseline optical interferometry. The magnitudes of these objects are at the edge of capabilities of current optical interferometers,…

Astrophysics · Physics 2009-11-07 Fabien Malbet

We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an…

Discrete Mathematics · Computer Science 2017-06-01 Valentin Gledel , Aline Parreau

Following the seminal work of Erlebach and van Leeuwen in SODA 2008, we introduce the minimum ply covering problem. Given a set $P$ of points and a set $S$ of geometric objects, both in the plane, our goal is to find a subset $S'$ of $S$…

Computational Geometry · Computer Science 2019-05-03 Therese Biedl , Ahmad Biniaz , Anna Lubiw

Circumstellar disks around young stars are the birthsites of planets. It is thus fundamental to study the disks in which they form, their structure and the physical conditions therein. The first astronomical unit is of great interest…

Solar and Stellar Astrophysics · Physics 2016-10-17 J. Kluska , R. Garcia Lopez , M. Benisty

Pupil-remapping is a new high-dynamic range imaging technique that has recently demonstrated feasibility on sky. The current prototypes present however deceiving limiting magnitude, restricting the current use to the brightest stars in the…

Instrumentation and Methods for Astrophysics · Physics 2014-03-18 Florentin Millour , Romain Petrov , Stéphane Lagarde , Philippe Berio , Yves Bresson , Lyu Abe

Given a set of $n$ points in the plane, the Unit Disk Cover (UDC) problem asks to compute the minimum number of unit disks required to cover the points, along with a placement of the disks. The problem is NP-hard and several approximation…

Computational Geometry · Computer Science 2022-05-05 Rachel Friederich , Matthew Graham , Anirban Ghosh , Brian Hicks , Ronald Shevchenko

Given a collection of n opaque unit disks in the plane, we want to find a stacking order for them that maximizes their visible perimeter---the total length of all pieces of their boundaries visible from above. We prove that if the centers…

Computational Geometry · Computer Science 2013-09-17 Gabriel Nivasch , János Pach , Gábor Tardos

Let $X$ be a set of points in $\mathbb{R}^2$ and $\mathcal{O}$ be a set of geometric objects in $\mathbb{R}^2$, where $|X| + |\mathcal{O}| = n$. We study the problem of computing a minimum subset $\mathcal{O}^* \subseteq \mathcal{O}$ that…

Computational Geometry · Computer Science 2024-03-04 Timothy M. Chan , Qizheng He , Jie Xue

Given a set $P$ of $n$ points and a set $S$ of $n$ weighted disks in the plane, the disk coverage problem is to compute a subset of disks of smallest total weight such that the union of the disks in the subset covers all points of $P$. The…

Computational Geometry · Computer Science 2024-07-02 Gang Liu , Haitao Wang

Sets of orthogonal basis functions over two-dimensional circular areas--most often representing pupils in optical applications--are known in the literature for the full circle (Zernike or Jacobi polynomials) and the annulus. This work…

Optics · Physics 2017-05-08 Richard J. Mathar

For a set of n points in the plane, we consider the axis--aligned (p,k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain n-k points. In this paper, we consider the boxes to be either squares or…

Computational Geometry · Computer Science 2010-07-28 Hee-Kap Ahn , Sang Won Bae , Erik D. Demaine , Martin L. Demaine , Sang-Sub Kim , Matias Korman , Iris Reinbacher , Wanbin Son

Long-baseline optical interferometers can now detect and resolve hot dust emission thought to arise at the inner edge of circumstellar disks around young stellar objects (YSOs). We argue that the near-infrared sizes being measured are…

Astrophysics · Physics 2009-11-07 J. D. Monnier , R. Millan-Gabet

Pupil mapping is a promising and unconventional new method for high contrast imaging being considered for terrestrial exoplanet searches. It employs two (or more) specially designed aspheric mirrors to create a high-contrast amplitude…

Astrophysics · Physics 2007-05-23 Ruslan Belikov , N. Jeremy Kasdin , Robert J. Vanderbei

We give a solution to Pick's interpolation problem on the unit polydisc in $\mathbb{C}^n$, $n\geq 2$, by characterizing all interpolation data that admit a $\mathbb{D}$-valued interpolant, in terms of a family of positive-definite kernels…

Complex Variables · Mathematics 2019-12-20 Gautam Bharali , Vikramjeet Singh Chandel

The current status of the high spatial resolution imaging interferometry in optical astronomy is reviewed in the light of theoretical explanation, as well as of experimental constraints that exist in the present day technology. The basic…

Astrophysics · Physics 2007-05-23 S. K. Saha
‹ Prev 1 2 3 10 Next ›