Related papers: Average angles of triangle in regular polygons
In this article we introduce a general definition of the concept of center of an $n$-gon, for $n\geq 3$, generalizing the idea of C. Kimberling for triangle. We define centers associated to functions instead of to geometrical properties. We…
We give mean square bounds for the remainder in the lattice point counting problem, counting the number of lattice points in a large ball in $\mathbb{R}^d$, when averaged over families of shears of the lattice.
Let E be a point in the plane of a convex quadrilateral ABCD. The lines from E to the vertices of the quadrilateral form four triangles. If we locate a triangle center in each of these triangles, the four triangle centers form another…
We study three families of polyhedral cones whose sections are regular simplices, cubes, and crosspolytopes. We compute solid angles and conic intrinsic volumes of these cones. We show that several quantities appearing in stochastic…
We revisit constructions based on triads of conics with foci at pairs of vertices of a reference triangle. We find that their 6 vertices lie on well-known conics, whose type we analyze. We give conditions for these to be circles and/or…
In this note we present a natural generalization of the minimum angle condition, commonly used in the finite element analysis for planar triangulations, to the case of simplicial meshes in any space dimension. The equivalence of this…
The average value of the number of intersection points of two plane curves given by trigonometrical polynomial maps of degree $N$ and bounded $L_2$- or $W_2^r$- norms is calculated
We develop a systematic method for computing the angle combinations at all vertices in an edge-to-edge tiling of the sphere by pentagons with the same five angles. The method is a useful and necessary step in many tiling problems about…
In this paper, we analyze the time complexity of finding regular polygons in a set of n points. We combine two different approaches to find regular polygons, depending on their number of edges. Our result depends on the parameter alpha,…
We study generalization of median triangles on the plane with two complex parameters. By specialization of the parameters, we produce periodical motion of a triangle whose vertices trace each other on a common closed orbit.
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…
We study the triangle inequalities for angles (with different definitions) and present inequalities concerning the entries of correlation matrices through the positivity of $3\times 3$ matrices. We extend our discussions to the inequalities…
We study the eleven points in the plane of a given triangle, whose pedal triangles are similar to the given one. We prove that the six points whose pedal triangles are positively oriented, lie on a single circle, while the five points,…
A spherical polyhedron surface is a triangulated surface obtained by isometric gluing of spherical triangles. For instance, the boundary of a generic convex polytope in the 3-sphere is a spherical polyhedron surface. This paper investigates…
This paper presents a general method for obtaining radius of the corresponding circumference to a cyclical polygon $n$ sides given the lengths of said sides, using the notion of complex number. As of radius $r$, obtained, can then be…
The number of triangles in a graph is useful to deduce a plethora of important features of the network that the graph is modeling. However, finding the exact value of this number is computationally expensive. Hence, a number of…
Generic spherical quadrilaterals are classified up to isometry. Condition of genericity consists in the requirement that the images of the sides under the developing map belong to four distinct circles which have no triple intersections.…
The incircle of a triangle touches the sides of the triangle in three points. It is well known that the lines from these points to the opposite vertices meet at a point known as the Gergonne point of the triangle. We use a computer to…
We investigate the average rank in the family of quadratic twists of a given elliptic curve defined over $\mathbb{Q}$, when the curves are ordered using the canonical height of their lowest non-torsion rational point.
We suggest a method of solving the problem of existence of a triangle with prescribed two bisectors and one third element which can be taken as one of the angles, the sides, the heights or the medians, or the third bisector.