Related papers: Simultaneous packing and covering in the two-dimen…

The problem of steady mixed convection boundary-layer flow on a cooled vertical permeable circular cylinder embedded in a fluid-saturated porous medium is studied. Here, we evaluate the flow and heat transfer characteristics numerically for…

We present a temporal decomposition scheme for solving long-horizon optimal control problems. In the proposed scheme, the time domain is decomposed into a set of subdomains with partially overlapping regions. Subproblems associated with the…

In this article, we address singularly perturbed two-parameter parabolic problem of the reaction-convection-diffusion type in two dimensions. These problems exhibit discontinuities in the source term and convection coefficient at particular…

Given a convex polygon $P$ with $n$ vertices, the two-center problem is to find two congruent closed disks of minimum radius such that they completely cover $P$. We propose an algorithm for this problem in the streaming setup, where the…

We study the Dirichlet problem associated to the equation for self-similar surfaces for graphs over the Euclidean plane with a disk removed. We show the existence of a solution provided the boundary conditions on the boundary circle are…

In this paper we prove that among all convex domains of the plane with two axis of symmetry, the maximizer of the first non trivial Neumann eigenvalue $\mu_1$ with perimeter constraint is achieved by the square and the equilateral triangle.…

The Navier-Stokes motions in cylindrical domain with Navier boundary conditions are considered. First the existence of global regular two-dimensional solutions are proved. The solutions are bounded by the same constant for all time.…

For $0<p<+\infty$, we prove a global $W^{2,p}$-estimate for potentials of optimal transport maps between convex domains in the plane. Among the tools developed for that purpose are obliqueness in general convex domains and estimates for the…

Let $k \geq 2$ be a constant. Given any $k$ convex polygons in the plane with a total of $n$ vertices, we present an $O(n\log^{2k-3}n)$ time algorithm that finds a translation of each of the polygons such that the area of intersection of…

We consider the integration of two-dimensional, piecewise constant functions with respect to copulas. By drawing a connection to linear assignment problems, we can give optimal upper and lower bounds for such integrals and construct the…

We give an overview of the 2024 Computational Geometry Challenge targeting the problem \textsc{Maximum Polygon Packing}: Given a convex region $P$ in the plane, and a collection of simple polygons $Q_1, \ldots, Q_n$, each $Q_i$ with a…

This paper proposes an intrinsic pseudospectral convexification framework for optimal control problems with manifold constraints. While successive pseudospectral convexification combines spectral collocation with successive convexification,…

We investigate the problem of packing identical hard objects on regular lattices in d dimensions. Restricting configuration space to parallel alignment of the objects, we study the densest packing at a given aspect ratio X. For rectangles…

This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…

Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…

We study the evolution of compact convex curves in two-dimensional space forms. The normal speed is given by the difference of the weighted inverse curvature with the support function, and in the case where the ambient space is the…

In this note we investigate the behavior of the volume that the convex hull of two congruent and intersecting simplices in Euclidean $n$-space can have. We prove some useful equalities and inequalities on this volume. For the regular…

This paper studies binary quadratic programs in which the objective is defined by a Euclidean distance matrix, subject to a general polyhedral constraint set. This class of nonconcave maximisation problems includes the capacitated,…

We solve Talagrand's entropy problem: the L_2-covering numbers of every uniformly bounded class of functions are exponential in its shattering dimension. This extends Dudley's theorem on classes of {0,1}-valued functions, for which the…

This paper introduces a natural definition for the volume of the unit ball in $n$-dimensional normed spaces $\mathbb{R}^n$. This definition preserves the Euclidean relation $P(B)/V(B)=n$ between the perimiter and the volume of the unit ball…