Related papers: Bisecting a triangle in a given direction
The visibility graph of a simple polygon represents visibility relations between its vertices. Knowing the correct order of the vertices around the boundary of a polygon and its visibility graph, it is an open problem to locate the vertices…
A (general) polygonal line tiling is a graph formed by a string of cycles, each intersecting the previous at an edge, no three intersecting. In 2022, Matsushita proved the matching complex of a certain type of polygonal line tiling with…
In this article, we briefly describe various tools and approaches that algebraic geometry has to offer to straighten bent objects. Throughout this article we will consider a specific example of a bent or curved piece of paper which in our…
The classic way to write down Pascal's triangle leads to entries in alternating rows being vertically aligned. In this paper, we prove a linear dependence on vertically aligned entries in Pascal's triangle. Furthermore, we give an…
A simple iteration methodology for the solution of a set of a linear algebraic equations is presented. The explanation of this method is based on a pure geometrical interpretation and pictorial representation. Convergence using this method…
The displacement and deviation vectors in spaces (manifolds), the tangent bundle of which is endowed with a transport along paths, are introduced. In case these spaces are equipped with a linear connection, the deviation equations (between…
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…
We study some examples when there is actually an equality in the linear algebra bound. When the vectors considered span in fact the entire space. We would like to point out that in some cases this provides some interesting extra information…
A well-known object in classical Euclidean geometry is the circumcenter of a triangle, i.e., the point that is equidistant from all vertices. The purpose of this paper is to provide a systematic study of the circumcenter of sets containing…
This paper gives a detailed derivation of the surface of a tri-axial ellipsoid. The general result is in terms of the elliptic integrals of the first and second kind. It is in checked for all special cases included and the corresponding…
In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…
Given a trivalent graph in the 3-dimensional Euclidean space, we call it a discrete surface because it has a tangent space at each vertex determined by its neighbor vertices. To abstract a continuum object hidden in the discrete surface, we…
The landscapes of a polyhedron are subsets of its nets one must consider to identify all shortest paths. Landscapes of cubes and tetrahedra have been used to identify coordinate based formulas for the lengths of the shortest paths between…
In this paper, we find all constant slope surfaces in the Euclidean 3-space, namely those surfaces for which the position vector of a point of the surface makes constant angle with the normal at the surface in that point. These surfaces…
For any three nonzero vectors $a,b,c$ in $\mathbb R^2$, we obtain a necessary and sufficient condition for the sum of the three pairwise angles between these vectors to equal $2\pi$. As an easy consequence of this, a proof of Euclid's…
The moduli space of triangles is a two-dimensional space that records triangle shapes in the plane, considered up to similarity. We study the subset corresponding to \textit{lattice triangles}, which are triangles whose vertices have…
It is well known that the area $U$ of the triangle formed by three tangents to a parabola $X$ is half of the area $T$ of the triangle formed by joining their points of contact. In this article, we study some properties of $U$ and $T$ for…
A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…
We show that every tiling of a convex set in the Euclidean plane $\mathbb{R}^2$ by equilateral triangles of mutually different sizes contains arbitrarily small tiles. The proof is purely elementary up to the discussion of one family of…
We present a general algorithm for finding the overlap area between two ellipses. The algorithm is based on finding a segment area (the area between an ellipse and a secant line) given two points on the ellipse. The Gauss-Green formula is…