Search Results for ""

The 60 Pascal lines of a hexagon inscribed in a conic intersect three at a time through 20 Steiner points, and also three at a time in 60 points known as Kirkman points. Each ...

The mean triangle area A^_ is the average area of a triangle in triangle picking within some given shape. As summarized in the following table, it is possible to compute the ...

The lines containing the three points of the intersection of the three pairs of opposite sides of a (not necessarily regular) hexagon. There are 6! (i.e., 6 factorial) ...

The dual of Brianchon's theorem (Casey 1888, p. 146), discovered by B. Pascal in 1640 when he was just 16 years old (Leibniz 1640; Wells 1986, p. 69). It states that, given a ...

A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...

An n-he (a term coined by Brendan Owen) is a shape formed from a polyhex by removing half of each hexagon in such a way that the remaining pieces are connected (Clarke). The ...

A generalization of the polyominoes using a collection of equal-sized equilateral triangles (instead of squares) arranged with coincident sides. Polyiamonds are sometimes ...

Consider a two-dimensional tessellation with q regular p-gons at each polygon vertex. In the plane, (1-2/p)pi=(2pi)/q (1) 1/p+1/q=1/2, (2) so (p-2)(q-2)=4 (3) (Ball and ...

The stability index Z^_(G) of a graph G is defined by Z^_=sum_(k=0)^(|_n/2_|)|c_(2k)|, where c_k is the kth coefficient of the characteristic polynomial and |_n_| denotes the ...

The most common statement known as Steiner's theorem (Casey 1893, p. 329) states that the Pascal lines of the hexagons 123456, 143652, and 163254 formed by interchanging the ...