Related papers: Intersecting the sides of a polygon
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of planar graphs that cannot be represented by pentagons. We also…
The manuscript presents a theoretical proof in conglomeration with new definitions on Inaccessibility and Inside for a point S related to a simple or self intersecting polygon P. The proposed analytical solution depicts a novel way of…
In this study, the properties of convex hexagons that can form rotationally symmetric edge-to-edge tilings are discussed. Because the convex hexagons are equilateral convex parallelohexagons, convex pentagons generated by bisecting the…
We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…
The farthest point map sends a point in a compact metric space to the set of points farthest from it. We focus on the case when this metric space is a convex centrally symmetric polyhedron, so that we can compose the farthest point map with…
We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…
On a compact complex affine manifold with a constant coefficient K\"ahler metric $\omega_0$, we introduce a concept: $(S,\omega_0)$-convexity and show that $(S,\omega_0)$-convexity is preserved by geodesics in the space of K\"ahler…
The pentagram map is a natural iteration on projective equivalence classes of (twisted) n-gons in the projective plane. It was recently proved ([OST]) that the pentagram map is completely integrable, with the complete set of Poisson…
It is conjectured that all decomposable (i.e. interior can be triangulated without adding new vertices) polyhedra with vertices in convex position are infinitesimally rigid and only recently has it been shown that this is indeed true under…
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…
An almost forgotten gem of Gauss tells us how to compute the area of a pentagon by just going around it and measuring areas of each vertex triangles (i.e. triangles whose vertices are three consecutive vertices of the pentagon). We give…
In this paper we study variations of the Hopf theorem concerning continuous maps $f$ of a compact Riemannian manifold $M$ of dimension $n$ to $\mathbb{R}^n$. We investigate the case when $M$ is a closed convex $n$-dimensional surface and…
Let $\Rx$ denote the ring of polynomials in $g$ freely non-commuting variables $x=(x_1,...,x_g)$. There is a natural involution * on $\Rx$ determined by $x_j^*=x_j$ and $(pq)^*=q^* p^*$ and a free polynomial $p\in\Rx$ is symmetric if it is…
In the convex covering problem, we are given a convex polygon with holes $P$ and the goal is to cover $P$ using a small number of convex polygons that lie inside $P$. In this paper, we solve the problem using the following strategy. We find…
Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene…
Let $P$ be a polygon with $r>0$ reflex vertices and possibly with holes and islands. A subsuming polygon of $P$ is a polygon $P'$ such that $P \subseteq P'$, each connected component $R$ of $P$ is a subset of a distinct connected component…
Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.
A deflated polygon is a polygon with no visibility crossings. We answer a question posed by Devadoss et al. (2012) by presenting a polygon that cannot be deformed via continuous visibility-decreasing motion into a deflated polygon. We show…
We classify projective toric manifolds whose dual variety is not a hypersurface in the dual projective space. Under the standard dictionary between toric geometry and convex geometry, they correspond to certain convex Delzant integer…
This paper is the second part of a two-part paper investigating the structure and properties of dyadic polygons. A dyadic polygon is the intersection of the dyadic subplane $D^2$ of the real plane $R^2$ and a real convex polygon with…