Related papers: Midpoint Diagonal Quadrilaterals
A convex quadrilateral, $Q$, is called a midpoint diagonal quadrilateral if the intersection point of the diagonals of $Q$ coincides with the midpoint of at least one of the diagonals of $Q$. A parallelogram, P, is a special case of a…
In an earlier paper of the author, we showed that there is a unique ellipse of minimal eccentricity, $E_I$, inscribed in any convex quadrilateral, $Q$. Using a different approach in this paper, we prove that there is a unique ellipse of…
In "Quartic Coincidences and the Singular Value Decomposition" by Clifford and Lachance, Mathematics Magazine, December, 2013, it was shown that if there is a midpoint ellipse(an ellipse inscribed in a quadrilateral, $Q$, which is tangent…
We prove that there exists a unique ellipse of minimal eccentricity, E_{I}, inscribed in a parallelogram, D. We also prove that the smallest nonnegative angle between equal conjugate diameters of E_{I} equals the smallest nonnegative angle…
Let Q be a convex quadrilateral in the xy plane and let int(Q) denote the interior of Q. Let D_1 and D_2 denote the diagonals of Q and let P denote their point of intersection. For (i)-(iii), let P_0 = (x_0,y_0) be a point in the interior…
We solve the following problem of W.H. Besant using a formula for the coefficients of an ellipse inscribed in a quadrilateral, $Q$: \enquote{If an ellipse be inscribed in a quadrilateral so that one focus is equidistant from the four…
If E is any ellipse inscribed in a convex quadrilateral, D, then we prove that Area(E)/Area(D) is less than or equal to pi/4, and equality holds if and only if D is a parallelogram and E is tangent to the sides of D at the midpoints. This…
First, we fill in key gaps in Steiner's nice characterization of the most nearly circular ellipse which passes through the vertices of a convex quadrilateral, D. Steiner proved that there is only one pair of conjugate directions, M1 and M2,…
An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…
The diagonals of a quadrilateral form four associated triangles, called half triangles. Each half triangle is bounded by two sides of the quadrilateral and one diagonal. If we locate a triangle center (such as the incenter, centroid,…
If $ABC$ is a given triangle in the plane, $P$ is any point not on the extended sides of $ABC$ or its anticomplementary triangle, $Q$ is the complement of the isotomic conjugate of $P$ with respect to $ABC$, $DEF$ is the cevian triangle of…
Let P be a point inside a convex quadrilateral ABCD. The lines from P to the vertices of the quadrilateral divide the quadrilateral into four triangles. If we locate a triangle center in each of these triangles, the four triangle centers…
We consider quadrangles of perimeter $2$ in the plane with marked directed edge. To such quadrangle $Q$ a two-dimensional plane $\Pi\in\mathbb{R}^4$ with orthonormal base is corresponded. Orthogonal plane $\Pi^\bot$ defines a plane…
In Euclidean geometry, a bicentric quadrilateral is a convex quadrilateral that has both a circumcircle passing through the four vertices and an incircle having the four sides as tangents. Consider a bicentric quadrilateral with rational…
A convex polygon $Q$ is inscribed in a convex polygon $P$ if every side of $P$ contains at least one vertex of $Q$. We present algorithms for finding a minimum area and a minimum perimeter convex polygon inscribed in any given convex…
Connect each vertex of a convex quadrilateral Q to the midpoint of the next (proceeding counterclockwise) side. The four connecting lines create an interior quadrilateral I. We study the ratio area(I)/area(Q). We also determine what happens…
Let $G$ denote a $Q$-polynomial distance-regular graph with diameter $D$ at least 4. Assume that the intersection numbers of $G$ satisfy $a_i=0$ for $0 \leq i \leq D-1$ and $a_D\neq 0$. We show that $G$ is a polygon, a folded cube, or an…
Let $T$ be a digraph with vertices $u_1, \dots, u_t$ ($t\ge 2$) and let $H_1, \dots, H_t$ be digraphs such that $H_i$ has vertices $u_{i,j_i},\ 1\le j_i\le n_i.$ Then the composition $Q=T[H_1, \dots, H_t]$ is a digraph with vertex set…
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…
The space of quadrilaterals with fixed side lengths is an elliptic curve. Darboux used this to prove a porism on foldings. In this article, the space of oriented quadrilaterals is studied on the base of biquadratic equations between their…