Search Results for ""
861 - 870 of 1317 for circleSearch Results
The Cunningham function, sometimes also called the Pearson-Cunningham function, can be expressed using Whittaker functions (Whittaker and Watson 1990, p. 353). ...
The point on the positive ray of the normal vector at a distance rho(s), where rho is the radius of curvature. It is given by z = x+rhoN (1) = x+rho^2(dT)/(ds), (2) where N ...
Let P=alpha:beta:gamma be a point not on a sideline of a reference triangle DeltaABC. Let A^' be the point of intersection AP intersection BC, B^'=BP intersection AC, and ...
The maximum number of pieces into which a cylinder can be divided by n oblique cuts is given by f(n) = (n+1; 3)+n+1 (1) = 1/6(n+1)(n^2-n+6) (2) = 1/6(n^3+5n+6), (3) where (a; ...
The cylinder function is defined as C(x,y)={1 for sqrt(x^2+y^2)<=a; 0 for sqrt(x^2+y^2)>a. (1) The Bessel functions are sometimes also called cylinder functions. To find the ...
A cylindric section is the intersection of a plane with a right circular cylinder. It is a circle (if the plane is at a right angle to the axis), an ellipse, or, if the plane ...
The Delaunay triangulation is a triangulation which is equivalent to the nerve of the cells in a Voronoi diagram, i.e., that triangulation of the convex hull of the points in ...
A delay differential equation (also called a differential delay equation or difference-differential equation, although the latter term has a different meaning in the modern ...
A square matrix A is called diagonally dominant if |A_(ii)|>=sum_(j!=i)|A_(ij)| for all i. A is called strictly diagonally dominant if |A_(ii)|>sum_(j!=i)|A_(ij)| for all i. ...
An unlabeled transitive digraph with n nodes is called a "topology." The numbers of distinct topologies on n=1, 2, ... nodes are 1, 3, 9, 33, 139, 718, 4535, ... (OEIS ...
...