# polyhedral

(redirected from polyhedron)
Also found in: Dictionary, Thesaurus, Encyclopedia, Wikipedia.
Related to polyhedron: regular polyhedron

## polyhedral

[pol″e-he´dral]
having many sides or surfaces.

## pol·y·he·dral

(pol'ē-hē'drăl),
Having many sides or facets.
[G. polyedros, many-sided, fr. poly- + G. hedra, seat, facet]

## polyhedral

/poly·he·dral/ (-he´dril) having many sides or surfaces.

## polyhedral

having many sides or surfaces.

## polyhedral

having many sides or surfaces.
References in periodicals archive ?
If F is a fundemantal polyhedron for a discontinuous group action [GAMMA], then, for every side S of F, there exists an element [[gamma].
Using the polyhedron orientation, a rectangle is calculated to cover it.
To design polyhedral packaging is good to know the way of conducting, the composition of geometric shapes around the building a rectangular boxes, but also to imagine the possibility of folding when deployable packaging and the need for an intuitive understanding of complex polyhedrons, see Fig.
The feasible region is a polyhedron, and it can be shown that the BFS are extreme points (vertices or corners) of the feasible region.
i] represents a point light source, and the rotating calipers then yields the portion of a convex polyhedron illuminated by that point.
In case of rotating the pentagons of the dodecahedron, so that they no longer have a common edge, but a common point, an irregular polyhedron with 60 equal edges is obtained, composed of 12 initial pentagons and 20 equilateral triangles in addition.
In general, after k steps of recursive subdivision to initial control polyhedronwe get k-level sub-control polyhedron Pk composed by the k-level control points pk ; i = 1, 2,.
Instead they claimed to have found a way of making those angles zero, which makes all the faces flat, and what is left is a true convex polyhedron .
The space between the hexahedron and the small octahedron (the dual polyhedron of the hexahedron) can be divided into 26 segments.
The famous formula, states that: The number of integral points in an integral polyhedron is equal to the area of the polyhedron plus half the number of integral points on the boundary of the polyhedron plus one, [absolute value of P[Intersection][Z.
d], in a polyhedron defined with linear inequalities of the form a x x [less than or equal to] b(t), where a [member of] [Z.
DNA photocleavage and anticancer activity of terpyridine copper(II) complexes having phenanthroline bases, Polyhedron, ISSN: 0277-5387, 29, 2787-2794 (2007).

Site: Follow: Share:
Open / Close