Related papers: The area of reduced spherical polygons
A regular polygon circumscribing another regular polygon (with a different side number) may be tightened to minimize the difference of both areas. The manuscripts computes the optimum result under the restriction that both polygons are…
A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $m\ge 7$. Finding the largest small $n$-gon for a given number $n\ge 3$ can be formulated as a nonconvex quadratically…
Monsky's theorem from 1970 states that a square cannot be dissected into an odd number of triangles of the same area, but it does not give a lower bound for the area differences that must occur. We extend Monsky's theorem to "constrained…
Polygon spaces have been studied extensively, and yet missing from the literature is a simple property that every polygon has: dimension. This is distinct (possibly) from the dimension of the ambient space in which the polygon lives. A…
The discrete isoperimetric inequality in Euclidean geometry states that among all $n$-gons having a fixed perimeter $p$, the one with the largest area is the regular $n$-gon. The statement is true in spherical geometry and hyperbolic…
Heron's formula states that the area $K$ of a triangle with sides $a$, $b$, and $c$ is given by $$ K=\sqrt {s(s-a) (s-b) (s-c)} $$ where $s$ is the semiperimeter $(a+b+c)/2$. Brahmagupta, Robbins, Roskies, and Maley generalized this formula…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
Consider the problem of fnding the smallest area convex $k$-gon containing $n\in\mathbb{N}$ congruent disks without an overlap. By using Wegner inequality in sphere packing theory we give a lower bound for the area of such polygons. For…
The deviation of a general convex body with twice differentiable boundary and an arbitrarily positioned polytope with a given number of vertices is studied. The paper considers the case where the deviation is measured in terms of the…
This article consists of two parts. The first part is a survey on the normal reduction numbers of normal surface singularities. It includes results on elliptic singularities, cone-like singularities and homogeneous hypersurface…
Lebesgue's universal covering problem is re-examined using computational methods. This leads to conjectures about the nature of the solution which if correct could provide a blueprint for a complete solution. Empirical lower bounds for the…
We discover some very general configuration results for constructing area-minimizing cones. In particular, given any closed minimal submanifold in some Euclidean sphere, every cone over the minimal product of sufficiently many copies of the…
A spherical n-gon is a bordered surface homeomorphic to a closed disk, with n distinguished boundary points called corners, equipped with a Riemannian metric of constant curvature 1, except at the corners, and such that the boundary arcs…
The formula for the area of a rhumb polygon, a polygon whose edges are rhumb lines on an ellipsoid of revolution, is derived and a method is given for computing the area accurately. This paper also points out that standard methods for…
We obtain new topological information about the local structure of collapsing under a lower sectional curvature bound. As an application we prove a new sphere theorem and obtain a partial result towards the conjecture that not every…
It is a classical fact in Euclidean geometry that the regular polygon maximizes area amongst polygons of the same perimeter and number of sides, and the analogue of this in non-Euclidean geometries has long been a folklore result. In this…
We show that every minimum area isosceles triangle containing a given triangle $T$ shares a side and an angle with $T$. This proves a conjecture of Nandakumar motivated by a computational problem. We use our result to deduce that for every…
We say that a polygon inscribed in the circle is asymmetric if it contains no two antipodal points being the endpoints of a diameter. Given $n$ diameters of a circle and a positive integer $k<n$, this paper addresses the problem of…
Consider random shadows of a cube and of a regular tetrahedron. Area and perimeter of the former are positively dependent (with correlation 0.915...), whereas area and perimeter of the latter appear to be negatively dependent. This is only…
Motivated by Elementary Problem B-1172 in the Fibonacci Quarterly (vol. 53, no. 3, pg. 273), formulas for the areas of triangles and other polygons having vertices with coordinates taken from various sequences of integers are obtained. The…