Related papers: Constructing a quadrilateral inside another one

In this work we study upper bounds for the ratio of successive inner and outer radii of a convex body K. This problem was studied by Perel'man and Pukhov and it is a natural generalization of the classical results of Jung and Steinhagen. We…

A convex quadrilateral with sides a,b,c,d, and diagonals p,q is cyclic iff abp-bcq+cdp-daq=0. This condition, in spite of its simplicity, appears to be unnoted and unexpectedly proof-resilient. We employ advanced methods of computer algebra…

A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. Rectangular layouts appear in various applications: as rectangular cartograms in cartography, as floorplans in building architecture and…

Let $K$ be a convex pentagon in the plane and let $K_1$ be the pentagon bounded by the diagonals of $K$. It has been conjectured that the maximum of the ratio between the areas of $K_1$ and $K$ is reached when $K$ is an affine regular…

We present a method for generating orthogonal quadrilateral meshes subject to user-defined feature alignment and sizing constraints. The approach relies on computing integrable orthogonal frame fields, whose symmetries are implicitly…

In a region R consisting of unit squares, a (domino) tiling is a collection of dominoes (the union of two adjacent squares) which pave fully the region. The flip graph of R is defined on the set of all tilings of R where two tilings are…

Given a trapezoid dissected into triangles, the area of any triangle determined by either diagonal of the trapezoid is integral over the ring generated by the areas of the triangles in the dissection. Given a parallelogram dissected into…

We discuss the cross-ratio map of planar quadrilateral linkages, also in the case when one of the links is telescopic. Most of our results are valid for a planar quadrilateral linkage with generic lengths of the sides. In particular, we…

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…

Suppose that $I$ is a unit square. Let $T$ (resp. $\Delta$) be an isosceles right triangle (resp. an equilateral triangle). We prove that any collection of triangles homothetic to $T$ (resp. $\Delta$), whose total area does not exceed…

Given a set of disjoint simple polygons $\sigma_1, \ldots, \sigma_n$, of total complexity $N$, consider a convexification process that repeatedly replaces a polygon by its convex hull, and any two (by now convex) polygons that intersect by…

Intersection numbers for subspace designs are introduced and $q$-analogs of the Mendelsohn and K\"ohler equations are given. As an application, we are able to determine the intersection structure of a putative $q$-analog of the Fano plane…

Quasi-polar spaces are sets of points having the same intersection numbers with respect to hyperplanes as classical polar spaces. Non-classical examples of quasi-quadrics have been constructed using a technique called pivoting [5]. We…

We collect various facts related loosely to random Gaussian quadrilaterals in the plane. For example, a side of a degenerate quadrilateral (one point inside three others) has a density that is non-Rayleigh.

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…

In this short note, we show that the inradius of a convex body is comparable to its volume divided by its surface area. We also give a simple formula, in terms of its volume and inradius, that is comparable to the volume of its intersection…

In the first section of this paper we prove a theorem for the number of columns of a rectangular area that are identical to the given one. In the next section we apply this theorem to derive several combinatorial identities by counting…

We give an $O(n)$ time and space algorithm for constructing a diagonal matrix congruent to A+xI, where A is the adjacency matrix of a cograph and $x\in \mathbb{R}$. Applications include determining the number of eigenvalues of a cograph's…

We compute in conventional dimensional regularisation the tree-level splitting amplitudes for a quark parent in the limit where four partons become collinear to each other. This is part of the universal infrared behaviour of the QCD…

This paper applies a complete parametric set for approximating the geometry of a quadrilateral element. The approximation basis used is a complete Pascal polynomial of second order with six free parameters. The interpolation procedure is a…