Related papers: The area of rhumb polygons
A point $p$ is said to be an area center of a polygon if all of the triangles composed of $p$ and its edges have one and the same area. We construct a moduli space $AC_n$ of such $n$-gons and study its geometry and arithmetic. For every…
A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turns always equals the number of right turns…
Consider a 2-plane $P \subset \mathbb{C}^n$ and let $D$ be a bounded region in $P$ with a piecewise-smooth boundary. Let $I(D)$ be the infimum of areas of all piecewise-smooth isotropic surfaces in $\mathbb{C}^n$ with the same boundary as…
A convex polyhedron, that is, a compact convex subset of $\mathbb{R}^3$ which is the intersection of finitely many closed half-spaces, can be rectified by taking the convex hull of the midpoints of the edges of the polyhedron. We derive…
We consider a spacelike two-plane originally at rest with respect to electromagnetic radiation in equilibrium. We find that if the plane is moved with respect to the radiation, the plane shrinks such that the maximum amount of entropy…
We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time…
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…
It is well known that the area $U$ of the triangle formed by three tangents to a parabola $X$ is half of the area $T$ of the triangle formed by joining their points of contact. In this article, we study some properties of $U$ and $T$ for…
We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…
This note concerns the area growth and bottom spectrum of complete stable minimal surfaces in a three-dimensional manifold with scalar curvature bounded from below. When the ambient manifold is the Euclidean space, by an elementary…
The Neumann problem on an ellipsoid in R^n asks for a function harmonic inside the ellipsoid whose normal derivative is some specified function on the ellipsoid. We solve this problem when the specified function on the ellipsoid is a…
Consider the set of solutions to a system of polynomial equations in many variables. An algebraic manifold is an open submanifold of such a set. We introduce a new method for computing integrals and sampling from distributions on algebraic…
Heron's formula from antiquity, for the area of a triangle, is used to relate volume form and infinitesimal square-volume of certain infinitesimal simplices in a Riemannian manifold
The computation of amoebas has been a challenging open problem for the last dozen years. The most natural approach, namely to compute an amoeba via its boundary, has not been practical so far since only a superset of the boundary, the…
We determine the conditions resulting from equating the area sums of alternative sectors in a circle generated by four, two, and three straight lines, respectively, that connect opposite points on its circumference while passing through a…
Regular polygons are characterized as area-constrained critical points of the perimeter functional with respect to particular families of perturbations in the class of polygons with a fixed number of sides. We also review recent results in…
Region extraction is a very common task in both Computer Science and Engineering with several applications in object recognition and motion analysis, among others. Most of the literature focuses on regions delimited by straight lines, often…
This second part on polygons in the hyperbolic plane is based on the first part which deals with uniqueness and existence of cocyclic polygons with prescribed sidelengths. The topic here is the maximum question for the area of these…
We study the problem of finding maximum-area triangles that can be inscribed in a polygon in the plane. We consider eight versions of the problem: we use either convex polygons or simple polygons as the container; we require the triangles…
In this paper, we consider the problem of partitioning a polygon into a set of connected disjoint sub-polygons, each of which covers an area of a specific size. The work is motivated by terrain covering applications in robotics, where the…