Search Results for ""

An n-dimensional open disk of radius r is the collection of points of distance less than r from a fixed point in Euclidean n-space. Krantz (1999, p. 3) uses the symbol D(x,r) ...

The y- (vertical) coordinate of a point in a two dimensional coordinate system. Physicists and astronomers sometimes use the term to refer to the axis itself instead of the ...

The diameter of a polygon is the largest distance between any pair of vertices. In other words, it is the length of the longest polygon diagonal (e.g., straight line segment ...

A prism graph, denoted Y_n, D_n (Gallian 1987), or Pi_n (Hladnik et al. 2002), and sometimes also called a circular ladder graph and denoted CL_n (Gross and Yellen 1999, p. ...

Let H be a Hilbert space and M a closed subspace of H. Corresponding to any vector x in H, there is a unique vector m_0 in M such that |x-m_0|<=|x-m| for all m in M. ...

The distance from the center of a circle to its perimeter, or from the center of a sphere to its surface. The radius is equal to half the diameter.

The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...

A pseudocylindrical map projection which distorts shape, area, scale, and distance to create attractive average projection properties.

The perpendicular distance h from an arc's midpoint to the chord across it, equal to the radius R minus the apothem r, h=R-r. (1) For a regular polygon of side length a, h = ...

Two nodes connected to the same node which are same distance from the root vertex in a rooted tree are called siblings. A function to return the siblings of a vertex v in a ...