Related papers: Compass Constructions
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…
A square trisection is a problem of assembling three identical squares from a larger square, using a minimal number of pieces. This paper presents an historical overview of the square trisection problem starting with its origins in 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…
A set $L$ of straight lines and a set $P$ of points in the Euclidean plane define an arrangement $\mathcal{A}$ = ($L$, $P$) of construction lines and registration marks, if and only if: (1) any point in $P$ is a point of intersection of at…
General methods for the construction of magic squares of any order have been searched for centuries. There have been several standard strategies for this purpose, such as the knight movement, or the construction of bordered magic squares,…
We count the number of conics through two general points in complete intersections when this number is finite and give an application in terms of quasi-lines.
This tutorial explains how to use piecewise cubic B\'ezier curves to draw arbitrarily oriented ellipses and elliptical arcs. The geometric principles discussed here result in strikingly simple interfaces for graphics functions that can draw…
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…
In order to generate novel 3D shapes with machine learning, one must allow for interpolation. The typical approach for incorporating this creative process is to interpolate in a learned latent space so as to avoid the problem of generating…
In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other…
The aim of this paper is to present a new method of approximation of planar data set using only arcs or segments. The first problem we are trying to solve is the following: the CNC machines can work only with simple curves (arcs or…
Starting with a flat sheet of paper, points can be constructed as the intersection of two folds. The set of constructible points clearly depends on which folds are admissible. In this paper, we study the situation where a fold is admissible…
A simple en,ex rule to mark the intersection points of 2D input polygon contours separating the polygon interior from its exterior in the vicinity of the intersections is presented. Its form is close to the original Greiner & Hormann…
We describe a purely image-based method for finding geometric constructions with a ruler and compass in the Euclidea geometric game. The method is based on adapting the Mask R-CNN state-of-the-art image processing neural architecture and…
For any simple digraph $D$ we offer a new proof for the intersection number of its middle digraph, $M(D)$; while doing so we also solve for the intersection number when $D$ has loops. In addition, a new transformation, the union of $D$ and…
The detection and classification of intersections between triangles are crucial tasks in a wide range of applications within Computer Graphics and Geometry Processing, including mesh Arrangements, mesh Booleans, and generic mesh processing…
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…
Consider a triangle $ABC$ with given lengths $l_a,l_b,l_c$ of its internal angle bisectors. We prove that in general, it is impossible to construct a square of the same area as $ABC$ using a ruler and compass. Moreover, it is impossible to…
This article is a gentle introduction to the mathematical area known as circle packing, the study of the kinds of patterns that can be formed by configurations of non-overlapping circles. The first half of the article is an exposition of…
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…