Related papers: A Trisectrix from a Carpenter's Square
Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…
A cubic surface in $P^3$ is known to contain 27 lines, out of which one can form 36 Schlafli double - sixes i.e., collections $l_1,...,l_6, l'_1,..., l'_6\}$ of 12 lines such that each $l_i$ meets only $l'_j, j\neq i$ and does not meet…
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…
Given two curves in $\PP^3$, either implicitly or by a parameterization, we want to check if they intersect. For that purpose, we present and further develop generalized resultant techniques. Our aim is to provide a closed formula in the…
The quadratic embedding property of graphs consisting of three paths (theta graphs) is fully characterised. For this aim, a theorem by Winkler (1985) is utilized. An alternative proof of that result using the RKHS technique is presented.
There are a wide variety of different vector formalisms currently utilized in engineering and physics. For example, Gibbs' three-vectors, Minkowski four-vectors, complex spinors in quantum mechanics, quaternions used to describe rigid body…
We give a formula for counting the triangles in a picture consisting of the three sides of a triangle and some cevians. This lets us prove statements that are claimed without proof in the Online Encyclopedia of Integer Sequences and some…
Let $ABC$ be an equilateral triangle. For certain triangles $T$ (the "tile") and certain $N$, it is possible to cut $ABC$ into $N$ copies of $T$. It is known that only certain shapes of $T$ are possible, but until now very little was known…
The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares…
This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, which are called irreducible triangulations. The structure has been introduced by Xin He under…
A graph is apex if there is a vertex whose deletion makes the graph planar, and doublecross if it can be drawn in the plane with only two crossings, both incident with the infinite region in the natural sense. In 1966, Tutte conjectured…
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
We describe an algorithm that takes as input an open book decomposition of a closed oriented 4-manifold and outputs an explicit trisection diagram of that 4-manifold. Moreover, a slight variation of this algorithm also works for open books…
The Serpinsky-Knopp curve is characterized as the only curve (up to isometry) that maps a unit segment onto a triangle of a unit area, so for any pair of points in the segment, the square of the distance between their images does not exceed…
Tensor diagrams are a handy way to depict complicated relationships between objects in projective geometry. One of the simpler ones takes two copies of a $3\times 3$ matrix and computes its adjugate. In this paper, we give a geometric…
We introduce a novel representation and optimization framework for discrete geodesics on triangle meshes that reduces artifacts of linear methods on uneven and coarse discretizations. Our method computes squared geodesic distances from…
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.
A sphere is a fundamental geometric object widely used in (computer aided) geometric design. It possesses rational parameterizations but no parametric polynomial parameterization exists. The present study provides an approach to the optimal…
Three circles define each of the Brocard points of a triangle. If one adds the three circles through a pair of vertices and the orthocentre one has nine circles. It is described how each of the nine centres of these circles lies at the…
The three-dimensional cylindrical regression problem is a problem of finding a cylinder best fitting a group of points in three-dimensional Euclidean space. The words best fitting are usually understood in the sense of the minimum root mean…