Related papers: Efficient construction by ruler and compass of a P…
We study algorithmic aspects of bending wires and sheet metal into a specified structure. Problems of this type are closely related to the question of deciding whether a simple non-self-intersecting wire structure (a carpenter's ruler) can…
Our goal is to present, in what we believe is the most efficient way possible, a construction of four mutually tangent circles.
In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…
Let Q denote the field of rational numbers. Let F \subseteq R is a euclidean field. We prove that: (1) if x,y \in F^n (n>1) and |x-y| is constructible by means of ruler and compass then there exists a finite set S(x,y) \subseteq F^n…
Polygons are a paramount data structure in computational geometry. While the complexity of many algorithms on simple polygons or polygons with holes depends on the size of the input polygon, the intrinsic complexity of the problems these…
We develop a new method for constructing "good" designs for computer experiments. The method derives its power from its basic structure that builds large designs using small designs. We specialize the method for the construction of…
Until recently, the simplest known flexible polyhedron was Steffen's polyhedron on nine vertices. However, in 2024, an embedded flexible polyhedron on eight vertices was announced. It attains the known lower bound for the number of…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
We explore several problems related to ruled polygons. Given a ruling of a polygon $P$, we consider the Reeb graph of $P$ induced by the ruling. We define the Reeb complexity of $P$, which roughly equates to the minimum number of points…
We obtain a construction of the total spherical perspective with ruler, compass, and nail. This is a generalization of the spherical perspective of Barre and Flocon to a 360 degree field of view. Since the 1960s, several generalizations of…
In this paper we develop in detail the geometric constructions that lead to many uniqueness results for the determination of polyhedral sets, typically scatterers, by a finite minimal number of measurements. We highlight how unique…
Congruent polygons are congruent in angles as well as in edge lengths. We concentrate on the angle aspect, and investigate how tilings of the sphere by congruent pentagons can be determined by the angle information only. We also investigate…
We construct triangular hyperbolic polyhedra whose links are generalized 4-gons. The universal cover of those polyhedra are hyperbolic buildings, which appartments are hyperbolic planes tesselated by regular triangles with angles $\pi/4$.…
We establish some new theorems on pentagon and pentagram.
In two series of papers we construct quasi regular polyhedra and their duals which are similar to the Catalan solids. The group elements as well as the vertices of the polyhedra are represented in terms of quaternions. In the present paper…
The pentagram map, introduced by R. Schwartz, is defined by the following construction: given a polygon as input, draw all of its "shortest" diagonals, and output the smaller polygon which they cut out. We employ the machinery of cluster…
The traditional construction of primitive Pythagorean triples by the formulas of two independent variables does not allow their ordering. The paper shows a new view on the construction of primitive Pythagorean triples. A method for…
Every normal periodic tiling is a strongly balanced tiling. The properties of periodic tilings by convex polygons are rearranged from the knowledge of strongly balanced tilings. From the results, we show the properties of representative…
We show that exchangeable structures such as Polya urn model and Chinese restaurant process can be constructed from sets with a real number of elements. From this construction, the exchangeability of these structures becomes obvious and the…
In this paper, we systematically study non-crossing chords of simple polygons in the plane. We first introduce the reduced Euler characteristic of a family of line-segments, and subsequently investigate the structure of the diagonals and…