TOPICS
Search

Search Results for ""


461 - 470 of 550 for Convex PolytopeSearch Results
A number of four-tetrahedron compounds can be constructed by rotating about the center-centroid lines of each face. Three such compounds are shown above for rotations by ...
The tetrahemihexahedron is the uniform polyhedron with Maeder index 4 (Maeder 1997), Wenninger index 67 (Wenninger 1989), Coxeter index 36 (Coxeter et al. 1954), and Har'El ...
There are a number of attractive polyhedron compounds consisting of five cubes. The first of these (left figures) consists of the arrangement of five cubes in the polyhedron ...
A cyclic quadrilateral is a quadrilateral for which a circle can be circumscribed so that it touches each polygon vertex. A quadrilateral that can be both inscribed and ...
Consider any star of n line segments through one point in space such that no three lines are coplanar. Then there exists a polyhedron, known as a zonohedron, whose faces ...
A "beam detector" for a given curve C is defined as a curve (or set of curves) through which every line tangent to or intersecting C passes. The shortest 1-arc beam detector, ...
Given a set of n+1 control points P_0, P_1, ..., P_n, the corresponding Bézier curve (or Bernstein-Bézier curve) is given by C(t)=sum_(i=0)^nP_iB_(i,n)(t), where B_(i,n)(t) ...
Bilinski (1960) noted that by collapsing any one of the five zones of the rhombic icosahedron, a second rhombic dodecahedron distinct from the dual polyhedron of the ...
Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...
A polyhedron is said to be canonical if all its polyhedron edges touch a sphere and the center of gravity of their contact points is the center of that sphere. In other ...
1 ... 44|45|46|47|48|49|50 ... 55 Previous Next

...