Search Results for ""

The Harborth graph is the smallest known 4-regular matchstick graph. It is therefore both planar and unit-distance. It has 104 edges and 52 vertices. This graph was named ...

A metric on a bunch of segments with a common endpoint O, which defines the distance between two points P_1 and P_2 as the length of the shortest path connecting them inside ...

A shell bounded by two similar ellipsoids having a constant ratio of axes. Given a chord passing through a homeoid, the distance between inner and outer intersections is ...

The point that inversion of a curve is performed with respect to.

The circle with respect to which an inverse curve is computed or relative to which inverse points are computed. In three dimensions, inverse points can be computed relative ...

The radius used in performing an inversion with respect to an inversion circle.

The length is the longest dimension of an object.

For two lines in the plane with endpoints (x_1,x_2) and (x_3,x_4), the angle between them is given by costheta=((x_2-x_1)·(x_4-x_3))/(|x_2-x_1||x_4-x_3|). (1) The angle theta ...

A linear code over a finite field with q elements F_q is a linear subspace C subset F_q^n. The vectors forming the subspace are called codewords. When codewords are chosen ...

Given a point P and a line AB, draw the perpendicular through P and call it PC. Let PD be any other line from P which meets CB in D. In a hyperbolic geometry, as D moves off ...