Search Results for ""
181 - 190 of 2224 for Point PartitioningSearch Results
Taking the locus of midpoints from a fixed point to a circle of radius r results in a circle of radius r/2. This follows trivially from r(theta) = [-x; 0]+1/2([rcostheta; ...
Let a line in three dimensions be specified by two points x_1=(x_1,y_1,z_1) and x_2=(x_2,y_2,z_2) lying on it, so a vector along the line is given by v=[x_1+(x_2-x_1)t; ...
The second de Villiers point is the perspector of the reference triangle and the excenter analog of the BCI triangle, which is Kimberling center X_(1128) has triangle center ...
If a univariate real function f(x) has a single critical point and that point is a local maximum, then f(x) has its global maximum there (Wagon 1991, p. 87). The test breaks ...
Sylvester's four-point problem asks for the probability q(R) that four points chosen at random in a planar region R have a convex hull which is a quadrilateral (Sylvester ...
In Euclidean space R^3, the curve that minimizes the distance between two points is clearly a straight line segment. This can be shown mathematically as follows using ...
In the case of a general surface, the distance between two points measured along the surface is known as a geodesic. For example, the shortest distance between two points on ...
In finding the average area A^__R of a triangle chosen from a closed, bounded, convex region R of the plane, then A^__(T(R))=A^__R, for T any nonsingular affine ...
A function y=f(x) has critical points at all points x_0 where f^'(x_0)=0 or f(x) is not differentiable. A function z=f(x,y) has critical points where the gradient del f=0 or ...
The maximum distance between n points in three dimensions can occur no more than 2n-2 times. Also, there exists a fixed number c such that no distance determined by a set of ...
...
View search results from all Wolfram sites (28185 matches)

