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

We give an overview of theoretical and practical aspects of finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of n points in the plane. Both problems are known to be NP-hard and were the…

We combine geometric methods with numerical box search algorithm to show that the minimal area of a convex set on the plane which can cover every closed plane curve of unit length is at least 0.0975. This improves the best previous lower…

We examine sequences of dense packings of n congruent non-overlapping disks inside a square which follow specific patterns as n increases along certain values, n = n(1), n(2),... n(k),.... Extending and improving previous work of Nurmela…

We present an algorithm to find an {\it Euclidean Shortest Path} from a source vertex $s$ to a sink vertex $t$ in the presence of obstacles in $\Re^2$. Our algorithm takes $O(T+m(\lg{m})(\lg{n}))$ time and $O(n)$ space. Here, $O(T)$ is the…

We prove the following asymptotically tight lower bound for $k$-color discrepancy: For any $k \geq 2$, there exists a hypergraph with $n$ hyperedges such that its $k$-color discrepancy is at least $\Omega(\sqrt{n})$. This improves on the…

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…

Given a sequence of properly embedded minimal surfaces in a $3$-manifold with local bounds on area and genus, we prove subsequential convergence, smooth away from a discrete set, to a smooth embedded limit surface, possibly with…

Let $K\subset \mathbb{C}$ be a convex compact set, and let $\Pi_n(K)$ be the class of polynomials of exact degree $n$, all of whose zeros lie in $K$. The Tur\'an type inverse Markov factor is defined by $M_n(K)=\inf_{P\in \Pi_n(K)}…

Given a convex polygon of $n$ sides, one can draw $n$ disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the…

We present a linear-time algorithm for finding the quadrilateral of largest area contained in a convex polygon, and we show that it is closely related to an old algorithm for the smallest enclosing parallelogram of a convex polygon.

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…

We obtain an upper bound on the lowest magnetic Neumann eigenvalue of a bounded, convex, smooth, planar domain with moderate intensity of the homogeneous magnetic field. This bound is given as a product of a purely geometric factor…

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ sides are unknown when $s \ge 4$. In this paper, we propose an approach to construct convex small $n$-gons of…

We prove that a region in a two-dimensional affine subspace of a normed space $V$ has the least 2-dimensional Hausdorff measure among all compact surfaces with the same boundary. Furthermore, the 2-dimensional Hausdorff area density admits…

We establish geometric lower bounds for the smallest positive eigenvalue of the Hodge Laplacian in the class of non-convex domains given by Euclidean annular regions with a convex outer boundary and a spherical inner boundary. These bounds…

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…

We prove there exists a compact embedded minimal surface in a complete finite volume hyperbolic $3$-manifold $\mathcal{N}$. We also obtain a least area, incompressible, properly embedded, finite topology, $2$-sided surface. We prove a…

In this note we prove that, if $S_n$ is the greatest area of a rectangle which can be covered with $n$ unit disks, then $2\leq S_n/n<3 \sqrt{3}/2$, and these are the best constants; moreover, for $\Delta(n):=(3\sqrt{3}/2)n-S_n$, we have…

We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…

We improve a lower bound for the smallest area of convex covers for closed unit curves from 0.0975 to 0.1, which makes it substantially closer to the current best upper bound 0.11023. We did this by considering the minimal area of convex…