相关论文: Lost at Sea

We study the best M\"obius approximations (BMA) to convex and concave conformal mappings of the disk, including the special case of mappings onto convex polygons. The crucial factor is the location of the poles of the BMAs. Finer details…

We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and…

In this note we construct smooth bounded domains $\Omega \subset \mathbb R^2$, other than disks, for which the overdetermined problem $$ \left\{ \begin{alignedat}{2} \Delta u + \lambda u &= 0 &\qquad& \text{ in } \Omega, \newline u &= b…

We present conjectured candidates for the least perimeter partition of a disc into $N \le 10$ regions which take one of two possible areas. We assume that the optimal partition is connected, and therefore enumerate all three-connected…

We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, whether there exists a convex shape whose boundary intersects at least $k$ regions of $\cal R$. We provide a polynomial time algorithm for…

In this paper, we propose new techniques for solving geometric optimization problems involving interpoint distances of a point set in the plane. Given a set $P$ of $n$ points in the plane and an integer $1 \leq k \leq \binom{n}{2}$, the…

In \emph{smooth orthogonal layouts} of planar graphs, every edge is an alternating sequence of axis-aligned segments and circular arcs with common axis-aligned tangents. In this paper, we study the problem of finding smooth orthogonal…

Let $K$ be a planar convex body af area $|K|$, and take $0 \textless{} \alpha \textless{} 1$.An $\alpha$-section of $K$ is a line cutting $K$ into two parts, one of whichhas area $\alpha|K|$. This article presents a systematic study of the…

We present a subgradient method for minimizing non-smooth, non-Lipschitz convex optimization problems. The only structure assumed is that a strictly feasible point is known. We extend the work of Renegar [5] by taking a different…

The objective function used in trajectory optimization is often non-convex and can have an infinite set of local optima. In such cases, there are diverse solutions to perform a given task. Although there are a few methods to find multiple…

In this article, we present an approximation algorithm for solving the Weighted Region Problem amidst a set of $ n $ non-overlapping weighted disks in the plane. For a given parameter $ \varepsilon \in (0,1]$, the length of the approximate…

Given $n$ points in the plane, a \emph{covering path} is a polygonal path that visits all the points. If no three points are collinear, every covering path requires at least $n/2$ segments, and $n-1$ straight line segments obviously suffice…

We construct $L_p$-estimates for the inhomogeneous Oseen system studied in a two dimensional exterior domain $\Omega$ with inhomogeneous slip boundary conditions. The kernel of the paper is a result for the half space $\mathbb{R}^2_+$.…

We consider Brownian motion in a bounded domain $\Omega$ on a two-dimensional Riemannian manifold $(\Sigma,g)$. We assume that the boundary $\p\Omega$ is smooth and reflects the trajectories, except for a small absorbing arc…

Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…

We study a one-dimensional ordinary differential equation modelling optical conveyor belts, showing in particular cases of physical interest that periodic solutions exist. Moreover, under rather general assumptions it is proved that the set…

We consider shape optimization problems involving functionals depending on perimeter, torsional rigidity and Lebesgue measure. The scaling free cost functionals are of the form $P(\Omega)T^q(\Omega)|\Omega|^{-2q-1/2}$ and the class of…

We carry on our study of the connection between two shape optimization problems with spectral cost. On the one hand, we consider the optimal design problem for the survival threshold of a population living in a heterogenous habitat…

We prove that if $\Omega\subset \mathbb{R}^{n+1}$ is a (not necessarily strictly) convex, $C^1$ domain, and $\mu$ and $\bar{\mu}$ are probability measures absolutely continuous with respect to surface measure on $\partial \Omega$, with…

We present a finitely convergent cutting-plane algorithm for solving a general mixed-integer convex program given an oracle for solving a general convex program. This method is extended to solve a family of two-stage mixed-integer convex…