TOPICS
Search

Search Results for ""


1001 - 1010 of 2674 for Distance Between PointsSearch Results
A surface which a monkey can straddle with both legs and his tail. A simple Cartesian equation for such a surface is z=x(x^2-3y^2), (1) which can also be given by the ...
Move a point Pi_0 along a line from an initial point to a final point. It traces out a line segment Pi_1. When Pi_1 is translated from an initial position to a final ...
Let C be a curve and let O be a fixed point. Let P be on C and let Q be the curvature center at P. Let P_1 be the point with P_1O a line segment parallel and of equal length ...
According to most authors (e.g., Kelley 1955, p. 113; McCarty 1967, p. 144; Willard 1970, p. 92) a regular space is a topological space in which every neighborhood of a point ...
A Taylor series is a series expansion of a function about a point. A one-dimensional Taylor series is an expansion of a real function f(x) about a point x=a is given by (1) ...
In the mice problem, also called the beetle problem, n mice start at the corners of a regular n-gon of unit side length, each heading towards its closest neighboring mouse in ...
The term "arbelos" means shoemaker's knife in Greek, and this term is applied to the shaded area in the above figure which resembles the blade of a knife used by ancient ...
A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...
An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...
The Conway-Smith graph is a distance-transitive graph on 63 vertices having intersection array {10,6,4,1;1,2,6,10} (Hall 1980). It is also distance-transitive. It is denoted ...
1 ... 98|99|100|101|102|103|104 ... 268 Previous Next

...