Related papers: Efficient construction by ruler and compass of a P…
This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…
In this paper, we present an approach to automated solving of triangle ruler-and-compass construction problems using finite-domain constraint solvers. The constraint model is described in the MiniZinc modeling language, and is based on the…
This paper proposes a simple technique of curve and surface construction with B-splines. Given a control polygon or a control mesh together with node ordinates corresponding to all control points, a rational curve or surface is obtained by…
In this study, the properties of convex pentagons that can form rotationally symmetric edge-to-edge tilings are discussed. Because the rotationally symmetric tilings are formed by concave octagons that are generated by two convex pentagons…
In the article "Construction of the discrete hull for the combinatorics of a regular pentagonal tiling of the plane" we gave the construction of a discrete hull for a combinatorial pentagonal tiling of the plane. In this paper, we give the…
In this work we prove constructively that the complement $\R^n\setminus\pol$ of a convex polyhedron $\pol\subset\R^n$ and the complement $\R^n\setminus\Int(\pol)$ of its interior are regular images of $\R^n$. If $\pol$ is moreover bounded,…
The aim of this note is to introduce a fast new general method for the construction of double and single even order magic squares. The method for double even order magic squares is fairly straight-forward but some adjustment is necessary…
We are interested in easy geometric transformations which regularize n-polygons in the non-euclidean plane. A transformation is called easy if it can be easily implemented into an algorithm. This article is motivated by preceding work on…
In this study, the properties of convex hexagons that can form rotationally symmetric edge-to-edge tilings are discussed. Because the convex hexagons are equilateral convex parallelohexagons, convex pentagons generated by bisecting the…
Let $K$ be a convex pentagon in the plane and let $K_1$ be the pentagon bounded by the diagonals of $K$. It has been conjectured that the maximum of the ratio between the areas of $K_1$ and $K$ is reached when $K$ is an affine regular…
This paper considers a simple geometric construction, called the Pentagram map. The pentagram map, performed on N-gons, gives rise to a birational mapping on the space of all N-gons. This paper finds what conjecturally are all the…
In this paper we discuss Chasles's construction on ellipsoid to draw the semi-axes from a complete system of conjugate diameters. We prove that there is such situation when the construction is not planar (the needed points cannot be…
Wythoff's construction associates a uniform polytope to a Coxeter diagram whose vertices are decorated with crosses, which indicate the subgroup stabilizing a generic point. Champagne, Kjiri, Patera, and Sharp remarked that by associating…
Given two regular graphs with consistent rotation maps, we produce a constructive method for a consistent rotation map on their Cartesian product. This method will be given as a simple set of rules of addition and table look ups. We assume…
A projective rectangle is like a projective plane that may have different lengths in two directions. We develop properties of the graph of lines, in which adjacency means having a common point, especially its strong regularity and clique…
We study the problem of construction of a triangle from the feet of its internal angle bisectors. It is proved that in general case ruler-and-compass solution of this problem is impossible.
In contrast to traditional toy tracks, a patented system allows the creation of a large number of tracks with a minimal number of pieces, and whose loops always close properly. These circuits strongly resemble traditional self-avoiding…
Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a one-dimensional compaction algorithm that alters…
We introduce a new method of generating Computer Aided Design (CAD) profiles via a sequence of simple geometric constructions including curve offsetting, rotations and intersections. These sequences start with geometry provided by a…
Orthogonal graph drawing has many applications, e.g., for laying out UML diagrams or cableplans. In this paper, we present a new pipeline that draws multigraphs orthogonally, using few bends, few crossings, and small area. Our pipeline…