相关论文: Natural Orderings of Triangle Centers

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…

We systematically investigate properties of various triangle centers (such as orthocenter or incenter) located on the four faces of a tetrahedron. For each of six types of tetrahedra, we examine over 100 centers located on the four faces of…

The diagonals of a quadrilateral form four associated triangles, called half triangles. Each half triangle is bounded by two sides of the quadrilateral and one diagonal. If we locate a triangle center (such as the incenter, centroid,…

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…

Given a right triangle ABC, with the ninety degree angle at A; consider the triangle O1OO2.Where the point O is the midpoint of the hypotenuseBC(and so the center of the triangle ABC's circumcircle), the point O1 being the triangle AOB's…

If we label the vertices of a triangle with 1, 2 and 4, and the orthocentre with 7, then any of the four numbers 1, 2, 4, 7 is the nim-sum of the other three and is their orthocentre. Regard the triangle as an orthocentric quadrangle.…

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.…

Let P be a point inside a convex quadrilateral ABCD. The lines from P to the vertices of the quadrilateral divide the quadrilateral into four triangles. If we locate a triangle center in each of these triangles, the four triangle centers…

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…

The diagonals of a quadrilateral form four component triangles (in two ways). For each of various shaped quadrilaterals, we examine 1000 triangle centers located in these four component triangles. Using a computer, we determine when the…

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…

This is a paper about triangle cubics and conics in classical geometry with elements of projective geometry. In recent years, N.J. Wildberger has actively dealt with this topic using an algebraic perspective. Triangle conics were also…

Let $G$ be an $n$-vertex connected graph. A cyclic base ordering of $G$ is a cyclic ordering of all edges such that every cyclically consecutive $n-1$ edges induce a spanning tree of $G$. In this project, we study cyclic base ordering of…

This paper treats triangles in the plane whose vertices lie on the integer lattice, i.e., the vertices have integer coordinates. It shows that apart from trivial examples, the circumcenter, centroid and orthocenter of such triangles never…

Non-Euclidean triangle centers can be described using homogeneous coordinates that are proportional to the generalized sines of the directed distances of a given center from the edges of the reference triangle. Identical homogeneous…

In this paper we present a way to define a set of orthocenters for a triangle in the n-dimensional space R^{n} and we will see some analogies of these orthocenters with the classic orthocenter of a triangle in the Euclidean plane.

The Longest Edge Bisection of a triangle is performed by joining the midpoint of its longest edge to the opposite vertex. Applying this procedure iteratively produces an infinite family of triangles. Surprisingly, a classical result of…

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…

Triangle centrality is introduced for finding important vertices in a graph based on the concentration of triangles surrounding each vertex. It has the distinct feature of allowing a vertex to be central if it is in many triangles or none…

Coordination geometries describe how the neighbours of a central particle are arranged around it. Such geometries can be thought to lie in an abstract topological space; a model of this space could provide a mathematical basis for…