Related papers: A geometric inequality for circle packings
We prove some eigenvalue inequalities for positive semidefinite matrices partitioned into four blocks. The inradius of the numerical range of the off-diagonal block contributes to these estimates. Some related norm inequalities are given…
We prove that a symmetric nonnegative function of two variables on a Lebesgue space that satisfies the triangle inequality for almost all triples of points is equivalent to some semimetric. Some other properties of metric triples (spaces…
We prove that the previously established inequality of different metrics for algebraic polynomials is sharp in the sense of order.
The aim of this note is to give two new conceptual proofs of Ionescu-Weitzenb\"ock's inequality. The first one, which is a vector proof, provides us a geometric interpretation of the difference between the two sides of this inequality and…
We study some properties convex functions fulfill. Among the conclusions we obtain from such result, we are able to prove some nontrivial inequalities among real numbers, and we give an improvement of the reverse triangle inequality in the…
We show that deciding whether a given set of circles can be packed into a rectangle, an equilateral triangle, or a unit square are NP-hard problems, settling the complexity of these natural packing problems. On the positive side, we show…
A sphere is a fundamental geometric object widely used in (computer aided) geometric design. It possesses rational parameterizations but no parametric polynomial parameterization exists. The present study provides an approach to the optimal…
Cylindrical algebraic decompositions (CADs) are a key tool for solving problems in real algebraic geometry and beyond. We recently presented a new CAD algorithm combining two advances: truth-table invariance, making the CAD invariant with…
Keller packings and tilings of boxes are investigated. Certain general inequality measuring a complexity of such systems is proved. A straightforward application to the unit cube tilings is given.
We study the triangle inequalities for angles (with different definitions) and present inequalities concerning the entries of correlation matrices through the positivity of $3\times 3$ matrices. We extend our discussions to the inequalities…
We propose a general framework for geometric approximation of circular arcs by parametric polynomial curves. The approach is based on constrained uniform approximation of an error function by scalar polynomials. The system of nonlinear…
We establish an inequality of different metrics for algebraic polynomials.
The problem of packing unequal circles into a circular container stands as a classic and challenging optimization problem in computational geometry. This study introduces a suite of innovative and efficient methods to tackle this problem.…
Many classical geometric inequalities on functionals of convex bodies depend on the dimension of the ambient space. We show that this dimension dependence may often be replaced (totally or partially) by different symmetry measures of the…
This paper starts by introducing results from geometric measure theory to prove symmetric decreasing rearrangement inequalities on $\mathbb{R}^n$, which give multiple proofs of the isoperimetric and P\'{o}lya-Szeg\H{o} inequalities. Then we…
By rectangle packing we mean putting a set of rectangles into an enclosing rectangle, without any overlapping. We begin with perfect rectangle packing problems, then prove two continuity properties for parallel rectangle packing problems,…
In quantum geometry, we consider a set of loops, a compact orientable surface and a solid compact spatial region, all inside $\mathbb{R} \times \mathbb{R}^3 \equiv \mathbb{R}^4$, which forms a triple. We want to define an ambient isotopic…
We present a complete system of inequalities for the inradius, circumradius, and diameter in the $3$-dimensional Euclidean space. To do so, we prove quasiconcavity of the inradius evaluated over $n$-simplices with a common facet…
This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles…
In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be $\mathsf{NP}$-hard. In this paper, we present new sufficient conditions…