Related papers: A Trisectrix from a Carpenter's Square
A good drawing of a simple graph is a drawing on the sphere or, equivalently, in the plane in which vertices are drawn as distinct points, edges are drawn as Jordan arcs connecting their end vertices, and any pair of edges intersects at…
How can we convince students, who have mainly learned to follow given mathematical rules, that mathematics can also be fascinating, creative, and beautiful? In this paper I discuss different ways of introducing non-Euclidean geometry to…
Mordell in 1958 gave a new proof of the three squares theorem. We generalize those techniques to characterize the integers represented by the remaining six "Ramanujan-Dickson ternaries" as well as three other ternary forms.
A symmetric Venn diagram is one that is invariant under rotation, up to a relabeling of curves. A simple Venn diagram is one in which at most two curves intersect at any point. In this paper we introduce a new property of Venn diagrams…
Gay and Meier asked whether or not a trisection diagram obtained by the Gluck twist on a spun or a twist spun 2-knot obtained from some method is standard. In this paper, we depict the trisection diagrams explicitly when the 2- knot is the…
We use a probabilistic interpretation of solid angles to generalize the well-known fact that the inner angles of a triangle sum to 180 degrees. For the 3-dimensional case, we show that the sum of the solid inner vertex angles of a…
In this paper we will do the following: (1) show how to geometrically define multiplication, using only basic plane geometry, independently of area and any notion of similar triangles; (2) prove all the properties of multiplication using…
A problem that is simple to state in the context of spherical geometry, and that seems rather interesting, appears to have been unexamined to date in the mathematical literature. The problem can also be recast as a problem in the real…
We propose an algorithm for tracing polylines on a triangle mesh such that: they are aligned with a N-symmetry direction field, and two such polylines cannot cross or merge. This property is fundamental for mesh segmentation and is very…
For an oriented $4$--dimensional fiber bundle over $S^{1}$, we build a relative trisection from a sutured Heegaard splitting of the fiber. We provide an algorithm to explicitly construct the associated relative trisection diagram, from a…
By a poly-line drawing of a graph G on n vertices we understand a drawing of G in the plane such that each edge is represented by a polygonal arc joining its two respective vertices. We call a turning point of a polygonal arc the bend. We…
We characterise the quartic (i.e. 4-regular) multigraphs with the property that every edge lies in a triangle. The main result is that such graphs are either squares of cycles, line multigraphs of cubic multigraphs, or are obtained from…
We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…
Two important classes of three-dimensional elements in computational meshes are hexahedra and tetrahedra. While several efficient methods exist that convert a hexahedral element to a tetrahedral elements, the existing algorithm for…
In this paper we generalize the notion of helix in the three-dimensional Euclidean space, which we define as that curve $C$ for which there is an $F$-constant vector field $W$ along $C$ that forms a constant angle with a fixed direction $V$…
In his treatise addressed to Dositheus of Pelusium, Archimedes of Syracuse obtained the result of which he was the most proud: a sphere has two-thirds the volume of its circumscribing cylinder. At his request a sculpted sphere and cylinder…
We give a new proof of the formula expressing the area of the triangle whose vertices are the projections of an arbitrary point in the plane onto the sides of a given triangle, in terms of the geometry of the given triangle and the location…
In this study, we define a new type of direction curves in the Euclidean 3-space such as osculating-direction curve. We give the characterizations for these curves. Moreover, we obtain the relationships between osculating direction curves…
In this paper, we define a new special curve in Euclidean 3-space which we call {\it $k-$slant helix} and introduce some characterizations for this curve. This notation is generalization of a general helix and slant helix. Furthermore, we…
In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn).