Search Results for ""
1831 - 1840 of 2615 for range of pointsSearch Results
A planar polygon is convex if it contains all the line segments connecting any pair of its points. Thus, for example, a regular pentagon is convex (left figure), while an ...
Let n points xi_1, ..., xi_n be randomly distributed on a domain S, and let H be some event that depends on the positions of the n points. Let S^' be a domain slightly ...
Given four points chosen at random inside a unit cube, the average volume of the tetrahedron determined by these points is given by ...
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 ...
Let Delta_1, Delta_2, and Delta_3 be tetrahedra in projective three-space P^3. Then the tetrahedra are said to be desmically related if there exist constants alpha, beta, and ...
To generate random points over the unit disk, it is incorrect to use two uniformly distributed variables r in [0,1] and theta in [0,2pi) and then take x = rcostheta (1) y = ...
Let f:R×R->R be a one-parameter family of C^2 map satisfying f(0,0)=0 [(partialf)/(partialx)]_(mu=0,x=0)=0 [(partial^2f)/(partialx^2)]_(mu=0,x=0)>0 ...
A grid usually refers to two or more infinite sets of evenly-spaced parallel lines at particular angles to each other in a plane, or the intersections of such lines. The two ...
Let s_i be the orders of singular points on a curve (Coolidge 1959, p. 56). Harnack's first theorem states that a real irreducible curve of order n cannot have more than ...
z(1-z)(d^2y)/(dz^2)+[c-(a+b+1)z](dy)/(dz)-aby=0. It has regular singular points at 0, 1, and infty. Every second-order ordinary differential equation with at most three ...
...
View search results from all Wolfram sites (63528 matches)

