Search Results for ""

A regular polygram {n/k} is generalization of a (regular) polygon on n sides (i.e., an n-gon) obtained by connecting every ith vertex around a circle with every (i+k)th, ...

The geometric centroid of a polyhedron composed of N triangular faces with vertices (a_i,b_i,c_i) can be computed using the curl theorem as x^_ = ...

The diagonal of a polyhedron is any line segment connecting two nonadjacent vertices of the polyhedron. Any polyhedron having no diagonals must have a skeleton which is a ...

A packing of polyhedron in three-dimensional space. A polyhedron which can pack with no holes or gaps is said to be a space-filling polyhedron. Betke and Henk (2000) present ...

The volume of a polyhedron composed of N triangular faces with vertices (a_i,b_i,c_i) can be computed using the curl theorem as V=1/6sum_(i=1)^Na_i·n_i, where the normal n_i ...

There are no tilings of the equilateral triangle of side length 7 by all the polyhexes of order n=4. There are nine distinct solutions of all the polyhexes of order n=4 which ...

Polykites are polyforms obtained from a regular triangular grid superposed on a regular hexagonal grid (its dual), illustrated above. The monokite is therefore a ...

A map defined by one or more polynomials. Given a field K, a polynomial map is a map f:K^n->K^m such that for all points (x_1,...,x_n) in K^n, ...

For a polynomial P=sum_(k=0)^na_kz^k, (1) several classes of norms are commonly defined. The l_p-norm is defined as ||P||_p=(sum_(k=0)^n|a_k|^p)^(1/p) (2) for p>=1, giving ...

The highest order power in a univariate polynomial is known as its order (or, more properly, its polynomial degree). For example, the polynomial ...