相关论文: Least-perimeter partitions of the disk into three …

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 prove that the least-perimeter partition of the sphere into four regions of equal area is a tetrahedral partition.

Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include…

We consider the Gaussian curvature conjecture of a minimal graph $S$ over the unit disk. First of all we reduce the general conjecture to the estimating the Gaussian curvature of some Scherk's type minimal surfaces over a quadrilateral…

In this paper, we consider minimal graphs in the three-dimensional Riemannian manifold $M\times\mathbb{R}$. We mainly estimate the Gaussian curvature of such surfaces. We consider the minimal disks and minimal graphs bounded by two Jordan…

In a disk graph, every vertex corresponds to a disk in $\mathbb{R}^2$ and two vertices are connected by an edge whenever the two corresponding disks intersect. Disk graphs form an important class of geometric intersection graphs, which…

Let $\mathcal{D}$ be a set of $n$ disks in the plane. The disk graph $G_\mathcal{D}$ for $\mathcal{D}$ is the undirected graph with vertex set $\mathcal{D}$ in which two disks are joined by an edge if and only if they intersect. The…

We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of…

This paper deals with finding surfaces in $\mathbb{R}^3$ which are as close as possible to being flat and span a given contour such that the contour is a geodesic on the sought surface. We look for a surface which minimizes the total…

We consider the problem of covering the boundary of a simple polygon on n vertices using the minimum number of geodesic unit disks. We present an O(n \log^2 n+k) time 2-approximation algorithm for finding the centers of the disks, with k…

We study partitions on three dimensional manifolds which minimize the total geodesic perimeter. We propose a relaxed framework based on a $\Gamma$-convergence result and we show some numerical results. We compare our results to those…

We study the problem of partitioning a given simple polygon $P$ into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for constructing such partitions that works for several notions of…

The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given $n$ points in the plane, the corresponding unit disk graph (UDG) has these points as vertices, and…

We study a variational problem for the perimeter associated with the Grushin plane, called minimal partition problem with trace constraint. This consists in studying how to enclose three prescribed areas in the Grushin plane, using the…

We show that a smooth unknotted curve in R^3 satisfies an isoperimetric inequality that bounds the area of an embedded disk spanning the curve in terms of two parameters: the length L of the curve and the thickness r (maximal radius of an…

We explore optimal circular nonconvex partitions of regular k-gons. The circularity of a polygon is measured by its aspect ratio: the ratio of the radii of the smallest circumscribing circle to the largest inscribed disk. An optimal…

In this paper, we solve the longstanding Gaussian curvature conjecture of a minimal graph $S$ over the unit disk. The conjecture asserts that for any minimal graph above the unit disk, the Gaussian curvature at the point directly above the…

We consider a variational model for periodic partitions of the upper half-space into three regions, where two of them have prescribed volume and are subject to the geometrical constraint that their union is the subgraph of a function, whose…

We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number of cut edges or their total length. We show that this…

We prove existence of partitions of an open set $\Omega$ with a given number of phases, which minimize the sum of the fractional perimeters of all the phases, with Dirichlet boundary conditions. In two dimensions we show that, if the…