Related papers: A quadrilateral half-turn theorem

The Erd\H{o}s-Anning theorem states that every point set in the Euclidean plane with integer distances must be either collinear or finite. More strongly, for any (non-degenerate) triangle of diameter~$\delta$, at most $O(\delta^2)$ points…

The van der Waerden's theorem reads that an equilateral pentagon in Euclidean 3-space $\Bbb E^3$ with all diagonals of the same length is necessarily planar and its vertex set coincides with the vertex set of some convex regular pentagon.…

A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover…

For a pair of points in a smooth locally convex surface in 3-space, its mid-plane is the plane containing its mid-point and the intersection line of the corresponding pair of tangent planes. In this paper we show that the limit of…

For a finite set $U$ of directions in the Euclidean plane, a convex non-degenerate polygon $P$ is called a $U$-polygon if every line parallel to a direction of $U$ that meets a vertex of $P$ also meets another vertex of $P$. We characterize…

Let J denote a simple closed curve in the plane. Let points a, b, c, d \in J occur in this order when traversing J in a counterclockwise direction. Define p(a,b,c,d) to be the ratio of ab*cd+ad*bc to ac*bd, where zw denotes distance between…

We classify spherical quadrilaterals up to isometry in the case when one inner angle is a multiple of pi while the other three are not. This is equivalent to classification of Heun's equations with real parameters and one apparent…

The central component of a polygon triangulation is defined as the triangle or diameter that contain its geometric center. More generally, every polygon dissection contains a central component. Using this notion, we derive new recurrences…

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of math.CO/0307347 which treats the minimally generically rigid case. The proof…

We study Saccheri`s three hypotheses on a two right-angled isosceles quadrilateral, with a rectilinear summit side. We claim that in the Hilbert`s foundation of geometry the euclidean parallelism is a theorem, and in the h-plane the…

A closed-form solution for the boundary of the flat state of an orthogonal cross section of contiguous surface geometry formed by the intersection of two cylinders of equal radii oriented in dual directions of rotation about their…

The convergence theory for the set of simultaneously $\psi$-approximable points lying on a planar curve is established. Our results complement the divergence theory developed in `Diophantine approximation on planar curves and the…

We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…

For given finite system of convex polygons in the plane which have no transversal, find such homothety transformations of polygons (having fixed centres inside given polygons) with minimal similarity ratio c>1 that the transformed system…

For a disk $D$ in the plane $\mathbb R^2$ and a plane map $f$, we give several conditions on the restriction of $f$ to the boundary $\partial D$ of $D$ which imply the existence of a fixed point of $f$ in some specified domain in $D$. These…

In this study, we introduce the notion of $PL_\delta$-homeomorphisms of $\mathbb{R}^n$. Furthermore, we provide a combinatorial criterion reliant on the vertices and edges of simplicial structures, to determine whether a piecewise-linear…

For any cubic graph in a closed orientable surface and a perfect matching, the Penrose-Kauffman polynomial is a sum of chromatic polynomials of a collection of associated graphs. A knot-theoretic perspective affords elementary proofs of old…

The Andreev-Thurston Circle Packing Theorem is generalized to packings of convex bodies in planar simply connected domains. This turns out to be a useful tool for constructing conformal and quasiconformal mappings with interesting geometric…

It is known that every homeomorphism of the plane has a fixed point in a non-separating, invariant subcontinuum. Easy examples show that a branched covering map of the plane can be periodic point free. In this paper we show that any…