Related papers: Constructing a quadrilateral inside another one
We study several models of random geometric subdivisions arising from the model of Diaconis and Miclo (2011). In particular, we show that the limiting shape of an indefinite subdivision of a quadrilateral is a.s.\ a parallelogram. We also…
Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…
We prove that, for any two polyhedral manifolds $\mathcal P,\mathcal Q$, there is a polyhedral manifold $\mathcal I$ such that $\mathcal P,\mathcal I$ share a common unfolding and $\mathcal I,\mathcal Q$ share a common unfolding. In other…
T. Keleti asked, whether the ratio of the perimeter and the area of a finite union of unit squares is always at most 4. In this paper we present an example where the ratio is greater than 4. We also answer the analogous question for regular…
We estimate whether there is an embedding from one n-dimensional rectangle into another which expands every k-dimensional area. Our estimate is sharp up to a constant factor in each dimension.
We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, whether there exists a convex shape whose boundary intersects at least $k$ regions of $\cal R$. We provide a polynomial time algorithm for…
Positive tuples of complete flags in $\mathbb{R}^3$ define two convex polygons in $\mathbb{RP}^2$, one inscribed in the other. We are interested in relating the Holmes-Thompson area of the inner polygon for the Hilbert metric on the outer…
The circumcircle of a planar convex polygon P is a circle C that passes through all vertices of P. If such a C exists, then P is said to be cyclic. Fix C to have unit radius. While any two angles of a uniform cyclic triangle are negatively…
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 compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…
Breaking a line segment L in two places at random, the three pieces can be configured as a triangle T with probability 1/4. We determine both the PDF and CDF for area(T) in terms of elliptic integrals. In particular, if L has length 1, then…
We construct Lagrange interpolating polynomials for a set of points and values belonging to the algebra of real quaternions $H\simeq R_{0,2}$, or to the real Clifford algebra $R_{0,3}$. In the quaternionic case, the approach by means of…
Let $K$ be a planar convex body af area $|K|$, and take $0 \textless{} \alpha \textless{} 1$.An $\alpha$-section of $K$ is a line cutting $K$ into two parts, one of whichhas area $\alpha|K|$. This article presents a systematic study of the…
We use three different methods to count the number of lines in the plane whose intersection with a fixed general quintic has fixed cross-ratios. We compare and contrast these methods, shedding light on some classical ideas which underly…
We give an account of well known calculations of the RO(Q)-graded coefficient rings of some of the most basic Q-equivariant cohomology theories, where Q is a group of order 2. One purpose is to advertise the effectiveness of the Tate…
If the four triangular facets of a tetrahedron can be partitioned into pairs having the same area, then the triangles in each pair must be congruent to one another. A Heron-style formula is then derived for the volume of a tetrahedron…
If there exists a cyclic quadrilateral whose sides go through the given four collinear points, then there are infinitely many such quadrilaterals inscribed in the same circle. We give two proofs of this porism; one based on cross-ratios,…
We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of…
Quadrilateral layouts on surfaces are valuable in texture mapping, and essential in generation of quadrilateral meshes and in fitting splines. Previous work has characterized such layouts as a special metric on a surface or as a meromorphic…
To consider the entanglement between the spatial region $A$ and its complement in a QFT, we need to assign a Hilbert space $\mathcal{H}_A$ to the region, by making a certain choice on the boundary $\partial A$. We argue that a small…