相关论文: A Shape-Newton approach to the problem of covering…
We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…
In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…
Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…
Finding nonoverlapping balls with given centers in any metric space, maximizing the sum of radii of the balls, can be expressed as a linear program. Its dual linear program expresses the problem of finding a minimum-weight set of cycles…
Some ball-quotient orbifolds are related by covering maps. We exploit these coverings to find infinite towers of orbifolds uniformized by the complex 2-ball and some orbifolds over K3 surfaces uniformized by the 2-ball. Corresponding…
We study the problem of aggregating polygons by covering them with disjoint representative regions, thereby inducing a clustering of the polygons. Our objective is to minimize a weighted sum of the total area and the total perimeter of the…
Primal and dual algorithms are developed for solving the $n$-dimensional convex optimization problem of finding the Euclidean ball of minimum radius that covers $m$ given Euclidean balls, each with a given center and radius. Each algorithm…
With the help of hyper-ideal circle pattern theory, we have developed a discrete version of the classical uniformization theorems for surfaces represented as finite branched covers over the Riemann sphere as well as compact polyhedral…
In general, standard necessary optimality conditions cannot be formulated in a straightforward manner for semi-smooth shape optimization problems. In this paper, we consider shape optimization problems constrained by variational…
We study a local version of the ball-covering problem in Banach spaces, and obtain a complete solution to it in terms of the norm derivatives. We illustrate the advantage of the local approach by obtaining substantial refinements of several…
New algorithms are presented for numerical conformal mapping based on rational approximations and the solution of Dirichlet problems by least-squares fitting on the boundary. The methods are targeted at regions with corners, where the…
We consider a shape optimization problem for the first mixed Steklov-Dirichlet eigenvalues of domains bounded by two balls in two-point homogeneous space. We give a geometric proof which is motivated by Newton's shell theorem
An extension of the Gauss-Newton algorithm is proposed to find local minimizers of penalized nonlinear least squares problems, under generalized Lipschitz assumptions. Convergence results of local type are obtained, as well as an estimate…
In this paper we investigate continuity properties of first and second order shape derivatives of functionals depending on second order elliptic PDE's around nonsmooth domains, essentially either Lipschitz or convex, or satisfying a uniform…
This article introduces a novel method for the implementation of shape optimisation with Lipschitz domains. We propose to use the shape derivative to determine deformation fields which represent steepest descent directions of the shape…
We introduce a novel numerical framework for the exploration of Blaschke--Santal\'o diagrams, which are efficient tools characterizing the possible inequalities relating some given shape functionals. We introduce a parametrization of convex…
We study a general smallest intersecting ball problem and its soft-margin variant in high-dimensional Euclidean spaces for input objects that are compact and convex. These two problems link and unify a series of fundamental problems in…
Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…
Given a set of disjoint simple polygons $\sigma_1, \ldots, \sigma_n$, of total complexity $N$, consider a convexification process that repeatedly replaces a polygon by its convex hull, and any two (by now convex) polygons that intersect by…