Related papers: Extracting squares from any quadrilateral

We extend our previous algorithm that generates all labeled graphs with a given graphical degree sequence to generate all labeled triangle-free graphs with a given graphical degree sequence. The algorithm uses various pruning techniques to…

The theorem on squaring a rectangle from a tiling of a quadrilateral (Schramm and Cannon-Floyd-Parry) gives a combinatorial version of the Riemann mapping theorem. We elucidate by example (the dumbbell) some of the limitations of…

We produce several algebraic curves, some well--known, some new, out of circles, by means of two classical (mutually reciprocal) algebraic methods: blow--down and blow--up.

This paper is concerned with the problem of finding $n$ distinct squares such that, on excluding any one of them, the sum of the remaining $n-1$ squares is a square. While parametric solutions are known when $n=3$ and $n=4$, when $n > 4$,…

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…

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…

This work proposes a novel metric based algorithm for quadrilateral mesh generating. Each quad-mesh induces a Riemannian metric satisfying special conditions: the metric is a flat metric with cone signualrites conformal to the original…

The square of a graph is obtained by adding additional edges joining all pair of vertices of distance two in the original graph. Particularly, if $C$ is a hamiltonian cycle of a graph $G$, then the square of $C$ is called a hamiltonian…

The question whether there exists a hypergraph whose degrees are equal to a given sequence of integers is a well-known reconstruction problem in graph theory, which is motivated by discrete tomography. In this paper we approach the problem…

We present computational methods for constructing orthogonal/orthonormal polynomials over arbitrary polygonal domains in $\mathbb{R}^2$ using bivariate spline functions. Leveraging a mature MATLAB implementation which generates spline…

We propose a simple algorithm for generating Binary Magic Squares (BMS), i.e., square binary matrices where the sum of all rows and all columns are equal. We show by induction that our algorithm always returns valid BMS with optimal…

Many questions about triangles and quadrilaterals with rational sides, diagonals and areas can be reduced to solving certain Diophantine equations. We look at a number of such questions including the question of approximating arbitrary…

We consider spherical quadrangulations -- spherical embeddings of multigraphs, possibly with loops, so that every face has boundary walk of length 4 -- in which all vertices have degree 3 or 4. Interpreting each degree 4 vertex as a…

In this paper, a theorem about similar triangles is proved. It shows that two small and four large triangles similar to the original triangle can appear if we choose well among several intersections of the perpendicular bisectors of the…

We show that any polyhedron forming a topological ball with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face to face. The result generalizes to non-simply-connected polyhedra satisfying an…

We present two versions of a method for generating all triangulations of any punctured surface in each of these two families: (1) triangulations with inner vertices of degree at least 4 and boundary vertices of degree at least 3 and (2)…

A surprising simple result about quadrilaterals is given as an application of the vector triple product identity.

The paper provides an elementary proof of Kenyon's necessary condition for the existence of a periodic tiling of the plane by squares with given periods. A similar new result on covering both sides of a rectangle by nonoverlaping squares is…

In this paper, a class of fractals, called quadrilateral labyrinth fractals, are introduced and studied. They are a special kind of fractals on any quadrilateral on the plane. This type of fractal is motivated by labyrinth fractal on the…

The method of generating Pythagorean triples is known for about 2000 years. Though the classical formulas produce all primitive triples they do not generate all possible triples, especially non-primitive triples. This paper presents a…