Related papers: Extracting squares from any quadrilateral
A novel parallel algorithm for matrix multiplication is presented. The hyper-systolic algorithm makes use of a one-dimensional processor abstraction. The procedure can be implemented on all types of parallel systems. It can handle…
There is a well-known connection between hypergraphs and bipartite graphs, obtained by treating the incidence matrix of the hypergraph as the biadjacency matrix of a bipartite graph. We use this connection to describe and analyse a…
The aim of this note is to introduce fastest new general methods for the construction of double and single even order magic squares. As in [5], the method for double even order magic squares is fairly straight-forward but some adjustments…
In this paper we give the first method for constructing n-multimagic squares (and hypercubes) for any n. We give an explicit formula in the case of squares and an effective existence proof in the higher dimensional case. Finally we prove…
This paper is devoted to presenting a new approach to determine the intersection of two quadrics based on the detailed analysis of its projection in the plane (the so called cutcurve) allowing to perform the corresponding lifting correctly.…
Every finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which…
The notion of quadratic maps between arbitrary groups appeared at several places in the literature on quadratic algebra. Here a unified extensive treatment of their properties is given; the relation with a relative version of Passi's…
A periodic parallelogram polyomino is a parallelogram polyomino such that we glue the first and the last column. In this work we extend a bijection between ordered trees and parallelogram polyominoes in order to compute the generating…
Plasma fractals is a technique to generate random and realistic clouds, textures and terrains~-- traditionally using recursive subdivision. We demonstrate a new approach, based on iterative expansion. It gives a family of algorithms that…
We give a complete description of all convex polyhedra whose surface can be constructed from several congruent regular pentagons by folding and gluing them edge to edge. Our method of determining the graph structure of the polyhedra from a…
Sums-of-squares formulas over the integers have been studied extensively using their equivalence to consistently signed intercalate matrices. This representation, combined with combinatorial arguments, has been used to produce…
A new method recovers the phase difference of interfering wavefronts from a pattern of interference fringes, avoiding the phase discontinuity problem. The method relies on the numerical solution of one-dimensional first-order ordinary…
To generate a triangle of unit perimeter, break a stick of length 1 in two places at random, with the condition that triangle inequalities are satisfied. Is there a similarly natural method for generating triangles of unit area? Study of a…
We solve a very classical problem motivated by considerations in quantum gravity: providing a description of the geometry of a Euclidean tetrahedron from the initial data of the areas of the faces and the areas of the medial parallelograms…
Let a polygon be composed of equal rectangles. We find all quadratic irrationals r for which the polygon can be tiled by similar rectangles with given side ratio r.
A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is presented, providing a new, clean geometric interpretation of the…
We consider the problem of $2$-coloring geometric hypergraphs. Specifically, we show that there is a constant $m$ such that any finite set of points in the plane $\mathcal{S} \subset {\mathbb R}^2$ can be $2$-colored such that every…
We provide a remarkably simple algorithm to compute all (at most four) common tangents of two disjoint simple polygons. Given each polygon as a read-only array of its corners in cyclic order, the algorithm runs in linear time and constant…
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…
This paper gives an algorithm to determine whether a number in a biquadratic field is a sum of two squares, based on local-global principle of isotropy of quadratic forms.