Search Results for ""

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

How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...

The placement of n points on a sphere so as to minimize the maximum distance of any point on the sphere from the closest one of the n points.

Consider a horse rider who wishes to feed his horse at a field, gather water from a river, and then return to his tent, all in the smallest overall distance possible. The ...

The Tixier point X_(476) is the reflection of the focus of the Kiepert parabola (X_(110)) in the Euler line. It has equivalent trilinear center functions X_(476) = ...

Given a reference triangle DeltaABC, the trilinear coordinates of a point P with respect to DeltaABC are an ordered triple of numbers, each of which is proportional to the ...

As defined in this work, a wheel graph W_n of order n, sometimes simply called an n-wheel (Harary 1994, p. 46; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 78), is a ...