TOPICS
Search

Search Results for ""


2981 - 2990 of 13135 for Computational GeometrySearch Results
For n points in the plane, there are at least N_1=sqrt(n-3/4)-1/2 different distances. The minimum distance can occur only <=3n-6 times, and the maximum distance can occur ...
Let (xi_1,xi_2) be a locally Euclidean coordinate system. Then ds^2=dxi_1^2+dxi_2^2. (1) Now plug in dxi_1=(partialxi_1)/(partialx_1)dx_1+(partialxi_1)/(partialx_2)dx_2 (2) ...
The maximal number of regions into which n lines divide a plane are N(n)=1/2(n^2+n+2) which, for n=1, 2, ... gives 2, 4, 7, 11, 16, 22, ... (OEIS A000124), the same maximal ...
The Plateau curves were studied by the Belgian physicist and mathematician Joseph Plateau. They have Cartesian equation x = (asin[(m+n)t])/(sin[(m-n)t]) (1) y = ...
The class m, curve order n, number of ordinary double points delta, number of cusps kappa, number of inflection points (inflection points) iota, number of bitangents tau, and ...
"Poincaré transformation" is the name sometimes (e.g., Misner et al. 1973, p. 68) given to what other authors (e.g., Weinberg 1972, p. 26) term an inhomogeneous Lorentz ...
A curve obtained by fitting polynomials to each ordinate of an ordered sequence of points. The above plots show polynomial curves where the order of the fitting polynomial ...
The contravariant four-vector arising in special and general relativity, x^mu=[x^0; x^1; x^2; x^3]=[ct; x; y; z], (1) where c is the speed of light and t is time. ...
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. ...
A subvariety of an algebraic variety that is not the entire variety. The proper subvarieties of a line are its nonempty finite subsets, the proper subvarieties of a plane are ...
1 ... 296|297|298|299|300|301|302 ... 1314 Previous Next

...