Related papers: The central component of a triangulation
We introduce the Primary Gasing Triangle, a right triangle with a hypotenuse of 1 unit, to define the primary trigonometric functions: sine and cosine. This triangle serves as the foundational element in a new approach to learning…
We show that the the image of the regular projection of a vertex of a cone over a triangle that minimizes the ratio of the cube of the area of the boundary of the cone and the square of the volume of the cone coincides with the incenter.
The conditions determining that two triangles are congruent play a basic role in planimetry. By comparing not congruent triangles with respect to given sets of corresponding elements it is important to discover if they have any common…
In this paper, we study several topics on pedal polygons. First, we prove the existence for pedal centers of triangles in a new way. From its proof, we find that the sum of area of outer and inner polygons is invariant under rotation.…
The Catalan triangle, as well as a Fuss-Catalan triangle, enter a problem of counting particular tied arc diagrams. This setting allows us to prove some combinatorial properties of these triangles.
Let P be a polygon whose vertices have been colored (labeled) cyclically with the numbers 1,2,...,c. Motivated by conjectures of Propp, we are led to consider partitions of P into k-gons which are proper in the sense that each k-gon…
We study families of triangles that are inscribed in a fixed circle and circumscribed about a central conic, extending the classical Chapple--Euler relation within the framework of Poncelet geometry. We establish several geometric…
This paper lays the foundations of triangulated persistence categories (TPC), which brings together persistence modules with the theory of triangulated categories. As a result we introduce several measurements and metrics on the set of…
Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…
There are several remarkable points, defined for polygons and multisets of points in the plane, called centers (such as the centroid). To make possible their study, there exists a formal definition for the concept of center in both cases.…
We present a geometric algorithm to compute the geometric kernel of a generic polyhedron. The geometric kernel (or simply kernel) is definedas the set of points from which the whole polyhedron is visible. Whilst the computation of the…
Principal component analysis is a widely-used method for the dimensionality reduction of a given data set in a high-dimensional Euclidean space. Here we define and analyze two analogues of principal component analysis in the setting of…
Quiver representations arise naturally in many areas across mathematics. Here we describe an algorithm for calculating the vector space of sections, or compatible assignments of vectors to vertices, of any finite-dimensional representation…
We show that a polygon can be uniquely determined by the lengths of non-central sections supporting a piecewise-analytic hedgehog in the interior of the polygon. We also prove the analogous result for slab areas - centrally-symmetric…
In this paper we deal with edge-to-edge, irreducible decompositions of a centrally symmetric convex $(2k)$-gon into centrally symmetric convex pieces. We prove an upper bound on the number of these decompositions for any value of $k$, and…
Recutting is an operation on planar polygons defined by cutting a polygon along a diagonal to remove a triangle, and then reattaching the triangle along the same diagonal but with opposite orientation. Recuttings along different diagonals…
There are four characteristic circles for each triangle on a plane. All for are tangential to the three straight lines containing the triangles' three sides. Three are exterior circles, the fourth is the in-circle. When the triangle is…
The geometric median of a domain is the point that minimises the average distance from itself to the points of the domain. We will give a gradient system of equations that defines the geometric median of a triangular domain and will prove a…
Most biological data are multidimensional, posing a major challenge to human comprehension and computational analysis. Principal component analysis is the most popular approach to rendering two- or three-dimensional representations of the…
The three Apollonius circles of a triangle, each passing through a triangle vertex, the corresponding vertex of the cevian triangle of the incenter and the corresponding vertex of the circumcevian triangle of the symmedian point, are…