What Is A Point Of Concurrency

You’re staring at a triangle. Three lines are drawn inside it — maybe they’re medians, maybe altitudes, maybe angle bisectors. They all cross at a single spot.

That spot has a name. It’s called a point of concurrency.

Most geometry students learn the term, memorize the four main triangle centers, and move on. But the concept shows up way past high school math. It’s in engineering, computer graphics, navigation, and even the way your phone figures out where you are.

Let’s break down what it actually is, why it matters, and the things textbooks tend to gloss over.

What Is a Point of Concurrency

The definition is straightforward: a point of concurrency is the single point where three or more lines, rays, segments, or planes intersect.

Notice the “three or more” part. Two lines intersecting is just an intersection. Worth adding: concurrency starts at three. In plane geometry, you’ll almost always see it with triangles because triangles are the simplest polygon where this gets interesting — three vertices, three sides, and a handful of special lines you can draw from each vertex or side.

The four classic triangle centers

Every triangle has four famous points of concurrency. You’ve probably seen the acronyms: centroid, circumcenter, incenter, orthocenter. Each comes from a different set of lines.

Centroid — medians. A median connects a vertex to the midpoint of the opposite side. All three medians meet at the centroid. It’s also the center of mass if the triangle is made of uniform material. Balance a cardboard triangle on a pencil tip at the centroid and it stays level.

Circumcenter — perpendicular bisectors. Draw a line perpendicular to each side at its midpoint. Those three lines meet at the circumcenter. It’s the center of the circle that passes through all three vertices (the circumscribed circle). The circumcenter can sit outside the triangle if the triangle is obtuse.

Incenter — angle bisectors. Bisect each interior angle. The three bisectors meet at the incenter. This is the center of the inscribed circle — the largest circle that fits completely inside the triangle touching all three sides. The incenter is always inside the triangle.

Orthocenter — altitudes. Drop a perpendicular from each vertex to the opposite side (or its extension). The three altitudes meet at the orthocenter. Like the circumcenter, the orthocenter can land outside the triangle for obtuse triangles.

There are others — the nine-point center, the Fermat point, the Napoleon points — but those four are the ones that show up on every exam.

Concurrency beyond triangles

Triangles don’t own the concept. Any polygon can have concurrent diagonals. In a regular hexagon, the three main diagonals all cross at the center. In projective geometry, concurrency is dual to collinearity — points lying on a line — and theorems like Ceva’s and Menelaus’s give algebraic conditions for when lines in a triangle are concurrent.

In 3D, you get concurrent planes. The corner of a room is a point of concurrency for three planes (two walls and the ceiling/floor).

Why It Matters / Why People Care

You might wonder: okay, lines cross. So what?

The “so what” is that concurrency turns a messy set of constraints into a single, solvable point. That’s powerful.

Structural engineering

Trusses and bridges rely on triangles because triangles are rigid. That's why those joints are points of concurrency. Engineers model this explicitly. Because of that, when forces travel along the members of a truss, they often converge at joints. If the members don’t actually meet at a single point — if there’s eccentricity — you get bending moments the member wasn’t designed for. A tiny offset in a joint can change the load path entirely.

Navigation and GPS

Your phone finds your location by trilateration. It measures distance to multiple satellites. In practice, the intersection of three spheres is a point (well, two points, but one is usually in space). Add a fourth satellite and you resolve the ambiguity and correct for clock error. Plus, each distance defines a sphere. Practically speaking, that intersection is a point of concurrency in 3D. The math is essentially solving for a concurrent point of spherical surfaces.

Computer graphics

Ray tracing, collision detection, mesh simplification — they all lean on intersection tests. Here's the thing — finding where three planes meet is a basic operation in building bounding volume hierarchies. But the centroid of a triangle mesh is used as a heuristic for spatial partitioning. Concurrency isn’t just a theorem; it’s a subroutine.

Optics and lens design

Fermat’s principle says light takes the path of least time. In a system of lenses, rays from a point source are bent to converge at an image point. That convergence is concurrency. Aberrations happen when rays that should* be concurrent aren’t — spherical aberration, coma, astigmatism are all failures of perfect concurrency.

Pure math

Ceva’s theorem gives a clean criterion: in triangle ABC, lines from vertices to opposite sides (AD, BE, CF) are concurrent if and only if (BD/DC) * (CE/EA) * (AF/FB) = 1. It’s a multiplicative condition that turns a geometric question into algebra. That’s the kind of bridge between geometry and algebra that makes modern math work. Easy to understand, harder to ignore.

How It Works (or How to Find Them)

Finding a point of concurrency depends on what lines you’re intersecting. Here’s the practical breakdown for the big four in a coordinate plane.

Centroid — the easiest one

If the vertices are A(x₁, y₁), B(x₂, y₂), C(x₃, y₃), the centroid G is just the average:

G = ((x₁ + x₂ + x₃)/3, (y₁ + y₂ + y₃)/3)

For more on this topic, read our article on what are the three steps in the formation of urine or check out how was the element chlorine discovered.

No slopes, no perpendiculars, no solving systems. Also, it’s the arithmetic mean of the vertices. This works because medians divide each other in a 2:1 ratio, and the centroid is 2/3 of the way from each vertex along its median.

Circumcenter — perpendicular bisectors

You need the intersection of two perpendicular bisectors. Steps:

Pick two sides, say AB and AC.
Find midpoints M_AB and M_AC.
Find slopes of AB and AC. The perpendicular slopes are negative reciprocals.
Write point-slope equations for the lines through the midpoints with those perpendicular slopes.
Solve the 2×2 linear system.

The solution is the circumcenter. The radius of the circumscribed circle is the distance from this point to any vertex.

Watch out: if the triangle is obtuse, the circumcenter lies outside. The algebra still works — you’ll just get coordinates that don’t fall inside the triangle’s bounding box.

Incenter — angle bisectors

This one is messier with coordinates. The angle bisector theorem says a bisector divides the opposite side proportionally to the adjacent sides. But the cleanest coordinate formula uses side lengths:

Let a = length of BC, b = length of AC, c = length of AB.

Incenter I = (ax₁ + bx₂ + cx₃) / (a + b + c), (ay₁ + by₂ + cy₃) / (a + b + c)

It’s a weighted average of the vertices, weighted by opposite side lengths. The inradius r = Area / s, where s = (a + b + c)/2 is the semiperimeter.

Orthocenter — altitudes

Altitudes are perpendicular to sides through opposite vertices. The orthocenter H has a neat coordinate relationship with the circumcenter O and centroid G: they’re collinear on the Euler line, and OG : GH = 1 : 2.

If you already have O and G, you can find H without

If you already have O and G, you can find H without solving for the intersection of two altitudes; the Euler line gives a direct vector relation. Since the centroid divides the segment OH in the ratio OG : GH = 1 : 2, we have

[ \mathbf{G}= \frac{2\mathbf{O}+\mathbf{H}}{3}\quad\Longrightarrow\quad \mathbf{H}=3\mathbf{G}-2\mathbf{O}. ]

In coordinates this reads

[ H_x = 3G_x - 2O_x,\qquad H_y = 3G_y - 2O_y . ]

If you prefer to work from the altitudes, pick a side—say BC—compute its slope (m_{BC}), take the negative reciprocal for the altitude from A, write the point‑slope line through A, and repeat for another vertex; solving the resulting 2 × 2 system yields the same point.

Beyond the Four Classic Centers

The concurrency theme extends far beyond centroid, circumcenter, incenter, and orthocenter. A few notable triangle centers illustrate how different cevian families meet at a single point:

Excenters – The intersection of two external angle bisectors and one internal bisector gives each excenter (I_A, I_B, I_C). They are the

the centers of the three excircles, each tangent to one side of the triangle and the extensions of the other two. Their coordinates follow the same weighted‑average pattern as the incenter, but with one weight negated:

[ I_A = \frac{-a\mathbf{A}+b\mathbf{B}+c\mathbf{C}}{-a+b+c},\quad I_B = \frac{a\mathbf{A}-b\mathbf{B}+c\mathbf{C}}{a-b+c},\quad I_C = \frac{a\mathbf{A}+b\mathbf{B}-c\mathbf{C}}{a+b-c}. ]

Nine‑point center (N) – The midpoint of the segment joining the orthocenter and circumcenter. It is the center of the circle that passes through the three midpoints of the sides, the three feet of the altitudes, and the three midpoints of the segments from each vertex to the orthocenter. Its radius is exactly half the circumradius.
Symmedian point (K) – The isogonal conjugate of the centroid. If lines through the vertices are drawn symmetrically to the medians with respect to the angle bisectors, they concur at K. In barycentric coordinates it is simply ((a^2:b^2:c^2)); in Cartesian form it is another weighted average:

[ K = \frac{a^2\mathbf{A}+b^2\mathbf{B}+c^2\mathbf{C}}{a^2+b^2+c^2}. ]

Fermat (or Torricelli) point – The point that minimizes the sum of distances to the three vertices. For triangles with all angles less than (120^\circ), it is the unique interior point from which every side subtends an angle of (120^\circ); otherwise it coincides with the obtuse‑angled vertex.

Why the Catalog Matters

Triangle centers are not merely geometric curiosities. They encode deep symmetries: the Euler line reveals a projective harmony among O, G, H, and N; isogonal conjugation pairs centers like the centroid and symmedian point, the incenter and itself, the circumcenter and orthocenter. Worth adding: modern triangle geometry—codified in Kimberling’s Encyclopedia of Triangle Centers* (ETC), now listing over 50,000 named centers—shows that every well‑defined center corresponds to a triangle‑center function homogeneous in the side lengths or angles. This algebraic uniformity lets us discover new centers by manipulating known functions, and it guarantees that any center defined by a symmetric construction will have a clean coordinate expression.

For the practitioner, the toolkit is straightforward: compute side lengths and coordinates once, then apply the weighted‑average formulas for the incenter, excenters, symmedian point, and centroid; use perpendicular‑bisector algebra for the circumcenter; and use the Euler‑line relation (\mathbf{H}=3\mathbf{G}-2\mathbf{O}) to obtain the orthocenter instantly. With these few patterns, the entire classical hierarchy—and a gateway to the vast modern theory—lies at your fingertips.