相关论文: The smallest convex $K$-gon containing $N$ congrue…

Generally, a graph G, an independent set is a subset S of vertices in G such that no two vertices in S are adjacent (connected by an edge) and a vertex cover is a subset S of vertices such that each edge of G has at least one of its…

We establish a version of the bottleneck conjecture, which in turn implies a partial solution to the Mahler conjecture on the product $v(K) = (\Vol K)(\Vol K^\circ)$ of the volume of a symmetric convex body $K \in \R^n$ and its polar body…

We consider the Minimum Convex Partition problem: Given a set P of n points in the plane, draw a plane graph G on P, with positive minimum degree, such that G partitions the convex hull of P into a minimum number of convex faces. We show…

H. Guggenheimer generalized the planar volume product problem for locally convex curves $C$ enclosing the origin $k \ge 2$ times. He conjectured that the minimal volume product $V(C)V(C^*)$ for these curves is attained if the curve consists…

It is proved that the simplex is a strict local minimum for the volume product, P(K)=min(vol(K) vol(K^z)), K^z is the polar body of K with respect to z, the minimum is taken over z in the interior of K, in the Banach-Mazur space of…

We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon $P$ with $n$ vertices. We give a randomized near-linear-time $(1-\varepsilon)$-approximation algorithm for…

A convex polygon Q is circumscribed about a convex polygon P if every vertex of P lies on at least one side of Q. We present an algorithm for finding a maximum area convex polygon circumscribed about any given convex n-gon in O(n^3) time.…

We consider the problem of computing the minimum value $f_{\min,K}$ of a polynomial $f$ over a compact set $K \subseteq \mathbb{R}^n$, which can be reformulated as finding a probability measure $\nu$ on $K$ minimizing $\int_K f d\nu$.…

We study the problem of minimum enclosing rectangle with outliers, which asks to find, for a given set of $n$ planar points, a rectangle with minimum area that encloses at least $(n-t)$ points. The uncovered points are regarded as outliers.…

Given a set $P$ of $n$ points in the plane and a collection of disks centered at these points, the disk graph $G(P)$ has vertex set $P$, with an edge between two vertices if their corresponding disks intersect. We study the dominating set…

We construct geometric barriers for minimal graphs in H^n xR. We prove the existence and uniqueness of a solution of the vertical minimal equation in the interior of a convex polyhedron in H^n extending continuously to the interior of each…

We discuss the optimization problem for minimizing the $(n-1)$-volume of the intersection of a convex cone $K$ in $\Bbb R^n$ with a hyperplane through a given point, first considered in \cite{We}. We give a geometric characterization of the…

A polygon C is an intersecting polygon for a set O of objects in the plane if C intersects each object in O, where the polygon includes its interior. We study the problem of computing the minimum-perimeter intersecting polygon and the…

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…

Let $K \subset \mathbb R^n$ be a convex body with barycenter at the origin. We show there is a simplex $S \subset K$ having also barycenter at the origin such that $\left(\frac{vol(S)}{vol(K)}\right)^{1/n} \geq \frac{c}{\sqrt{n}},$ where…

We consider the following measure of symmetry of a convex n-dimensional body K: $\rho(K)$ is the smallest constant for which there is a point x in K such that for partitions of K by an n-1-dimensional hyperplane passing through x the ratio…

We prove the theorem mentioned in the title, for ${\mathbb{R}}^n$, where $n \ge 3$. The case of the simplex was known previously. Also, the case $n=2$ was settled, but there the infimum was some well-defined function of the side lengths. We…

In 1934, Reinhardt asked for the centrally symmetric convex domain in the plane whose best lattice packing has the lowest density. He conjectured that the unique solution up to an affine transformation is the smoothed octagon (an octagon…

We prove a lower bound for the first Steklov eigenvalue of embedded minimal hypersurfaces with free boundary in a compact $n$-dimensional manifold which has nonnegative Ricci curvature and strictly convex boundary. When $n=3$, this implies…

The minimum convex cover problem seeks to cover a polygon $P$ with the fewest convex polygons that lie within $P$. This problem is $\exists\mathbb R$-complete, and the best previously known algorithm, due to Eidenbenz and Widmayer (2001),…