Search Results for ""

There are four completely different definitions of the so-called Apollonius circles: 1. The set of all points whose distances from two fixed points are in a constant ratio ...

A triangle line lalpha+mbeta+ngamma=0 defined relative to a reference triangle is called a central line iff l:m:n is a triangle center (Kimberling 1998, p. 127). If l:m:n is ...

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...

The straight line on which all points at infinity lie. The line at infinity is central line L_6 (Kimberling 1998, p. 150), and has trilinear equation aalpha+bbeta+cgamma=0, ...

The points of intersection of the adjacent angle trisectors of the angles of any triangle DeltaABC are the polygon vertices of an equilateral triangle DeltaDEF known as the ...

The intersection H of the three altitudes AH_A, BH_B, and CH_C of a triangle is called the orthocenter. The name was invented by Besant and Ferrers in 1865 while walking on a ...

Square triangle picking is the selection of triples of points (corresponding to endpoints of a triangle) randomly placed inside a square. n random triangles can be picked in ...

The Steiner circumellipse is the circumellipse that is the isotomic conjugate of the line at infinity and the isogonal conjugate of the Lemoine axis. It has circumconic ...

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...

In a given circle, find an isosceles triangle whose legs pass through two given points inside the circle. This can be restated as: from two points in the plane of a circle, ...