Search Results for ""

The triangle graph is the cycle graph C_3, which is isomorphic to the complete graph K_3 as well as to the complete tripartite graph K_(3×1)=K_(1,1,1) and the triangular ...

The Tusi couple is a 2-cusped hypocycloid obtained by rolling a circle of radius a inside a circle of radius 2a. The result is a line segment (Steinhaus 1999, p. 145; Kanas ...

Two lattice points (x,y) and (x^',y^') are mutually visible if the line segment joining them contains no further lattice points. This corresponds to the requirement that ...

A web diagram, also called a cobweb plot, is a graph that can be used to visualize successive iterations of a function y=f(x). In particular, the segments of the diagram ...

The Wiener sausage of radius a>0 is the random process defined by W^a(t)= union _(0<=s<=t)B_a(beta(s)) where here, beta(t) is the standard Brownian motion in R^d for t>=0 and ...

A lattice path from one point to another is p-good if it lies completely below the line y=(p-1)x. (1) Hilton and Pederson (1991) show that the number of p-good paths from (1, ...

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

Geometric objects lying in a common plane are said to be coplanar. Three noncollinear points determine a plane and so are trivially coplanar. Four points are coplanar iff the ...

A grid usually refers to two or more infinite sets of evenly-spaced parallel lines at particular angles to each other in a plane, or the intersections of such lines. The two ...

The Klein-Beltrami model of hyperbolic geometry consists of an open disk in the Euclidean plane whose open chords correspond to hyperbolic lines. Two lines l and m are then ...