Search Results for ""
221 - 230 of 735 for Uniform PolyhedronSearch Results
The term rectification is sometimes used to refer to the determination of the length of a curve. Rectification also refers to the operation which converts the midpoints of ...
A sequence of n-tuples that fills n-space more uniformly than uncorrelated random points, sometimes also called a low-discrepancy sequence. Although the ordinary uniform ...
A standard form of the linear programming problem of maximizing a linear function over a convex polyhedron is to maximize c·x subject to mx<=b and x>=0, where m is a given ...
Define the Euler measure of a polyhedral set as the Euler integral of its indicator function. It is easy to show by induction that the Euler measure of a closed bounded ...
Expansion is an affine transformation (sometimes called an enlargement or dilation) in which the scale is increased. It is the opposite of a geometric contraction, and is ...
A line segment connecting nonadjacent polyhedron vertices sharing a common face in a parallelepiped or other similar solid.
Truncation is the removal of portions of solids falling outside a set of symmetrically placed planes. The operation implemented as Truncate[polyhedron, r] in the Wolfram ...
In real and functional analysis, equicontinuity is a concept which extends the notion of uniform continuity from a single function to collection of functions. Given ...
A uniform distribution of points on the circumference of a circle can be obtained by picking a random real number between 0 and 2pi. Picking random points on a circle is ...
The pure equation x^p=C of prime degree p is irreducible over a field when C is a number of the field but not the pth power of an element of the field. Jeffreys and Jeffreys ...
...
View search results from all Wolfram sites (3206 matches)

