Related papers: Efficient construction by ruler and compass of a P…
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.
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
In this article, we describe symplectic and complex toric spaces associated to the five regular convex polyhedra. The regular tetrahedron and the cube are rational and simple, the regular octahedron is not simple, the regular dodecahedron…
In this paper, we propose a topology optimization (TO) framework where the design is parameterized by a set of convex polygons. Extending feature mapping methods in TO, the representation allows for direct extraction of the geometry. In…
This paper describes an efficient approach to constructing a resultant polyline with a minimum number of segments and arcs. While fitting an arc can be done with complexity O(1) (see [1] and [2]), the main complexity is in checking that the…
Several commonly observed physical and biological systems are arranged in shapes that closely resemble an honeycomb cluster, that is, a tessellation of the plane by regular hexagons. Although these shapes are not always the direct product…
It is well-known that pythagorean triples can be represented by points of the unit circle with rational coordinates. These points form an abelian group, and we describe its structure. This structural description yields, almost immediately,…
Let $P$ and $Q$ be simple polygons with $n$ vertices each. We wish to compute triangulations of $P$ and $Q$ that are combinatorially equivalent, if they exist. We consider two versions of the problem: if a triangulation of $P$ is given, we…
We give a formula for the number of interior intersection points made by the diagonals of a regular $n$-gon. The answer is a polynomial on each residue class modulo 2520. We also compute the number of regions formed by the diagonals, by…
In this paper we obtain cyclic pentagons and hexagons with rational sides, diagonals and area all of which are expressed in terms of rational functions of several arbitrary rational parameters. On suitable scaling, we obtain cyclic…
Given a planar pentagon, construct two new pentagons: the vertices of the first one are the intersection points of the diagonals of the original pentagon, and the vertices of the second one are the tangency points of the conic inscribed in…
A triangulation of a polygon has an associated Stanley-Reisner ideal. We obtain a full algebraic and combinatorial understanding of these ideals, and describe their separated models. More generally we do this for stacked simplicial…
We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally…
The aim of this paper is two-fold. First, the study of $C_{12}$-structure (called by us corner structure) is extended to the general case without any condition, unlike our previous papers (see, \cite{BB, BG2, BG, BBB}). Second, starting…
This note contains a short proof of a classical result: any rational symplectic matrix can be put in diagonal form after right and left multiplication by integral symplectic matrices.
Many statistical problems involve the estimation of a $\left(d\times d\right)$ orthogonal matrix $\textbf{Q}$. Such an estimation is often challenging due to the orthonormality constraints on $\textbf{Q}$. To cope with this problem, we…
We construct Lagrangian translating solitons by desingularizing the intersection points between Lagrangian Grim Reaper cylinders with the same phase using special Lagrangian Lawlor necks. The resulting Lagrangian translating solitons could…
We establish a relationship between the two important central lines of the triangle, the Euler line and the Brocard axis, in a configuration with an arbitrary rectangle and a random point. The classical Cartesian coordinate system method…
A few pages in Siegel describe how, starting with a fundamental polygon for a compact Riemann surface, one can construct a symplectic basis of its homology. This note retells that construction, specializing to the case where the surface is…
Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic $l_1$-metric is thus inherited from the product of…