Search Results for ""

Bisection is the division of a given curve, figure, or interval into two equal parts (halves). A simple bisection procedure for iteratively converging on a solution which is ...

As defined by Kyrmse, a canonical polygon is a closed polygon whose vertices lie on a point lattice and whose edges consist of vertical and horizontal steps of unit length or ...

If the four points making up a quadrilateral are joined pairwise by six distinct lines, a figure known as a complete quadrangle results. A complete quadrangle is therefore a ...

Four or more points P_1, P_2, P_3, P_4, ... which lie on a circle C are said to be concyclic. Three points are trivially concyclic since three noncollinear points determine a ...

For a connected graph G of graph diameter d, the distance-k graph G_k for k=1, ..., d is a graph with the same vertex set and having edge set consisting of the pairs of ...

If two intersections of each pair of three conics S_1, S_2, and S_3 lie on a conic S_0, then the lines joining the other two intersections of each pair are concurrent (Evelyn ...

Let C=C^+ union C^- (where C^+ intersection C^-=emptyset) be the disjoint union of two finite components C^+ and C^-. Let alpha and beta be two involutions on C, each of ...

Goldberg polyhedra are convex polyhedra first described by Goldberg (1937) and classified in more detail by Hart (2013) for which each face is a regular pentagon or regular ...

A nonassociative algebra named after physicist Pascual Jordan which satisfies xy=yx (1) and (xx)(xy)=x((xx)y)). (2) The latter is equivalent to the so-called Jordan identity ...

A number of points on a line segment. The term was first used by Desargues (Cremona 1960, p. x). If the points A, B, C, ... lie on a line segment with the coordinates of the ...