Search Results for ""
491 - 500 of 830 for Convex PolyhedronSearch Results
The great stellated truncated dodecahedron, also called the quasitruncated great stellated dodecahedron is the uniform polyhedron with Maeder index 66 (Maeder 1997), ...
The great truncated icosahedron, also called the truncated great icosahedron, is the uniform polyhedron with Maeder index 55 (Maeder 1997), Wenninger index 95 (Wenninger ...
The Herschel nonahedron is a canonical polyhedron whose skeleton is the Herschel graph. It has 11 vertices, 18 edges, and 9 faces. Of the edges, 6 are short and 12 are long. ...
A parallelohedron is a space-filling polyhedron that fills space using an infinite number of similarly situated copies (Tutton 1964, pp. 567 and 723; Coxeter 1973, pp. ...
A self-dual graphs is a graph that is dual to itself. Wheel graphs are self-dual, as are the examples illustrated above. Naturally, the skeleton of a self-dual polyhedron is ...
The snub icosidodecadodecahedron is the uniform polyhedron with Maeder index 46 (Maeder 1997), Wenninger index 112 (Wenninger 1989), Coxeter index 58 (Coxeter et al. 1954), ...
In homogeneous coordinates, the first positive quadrant joins (0,1) with (1,0) by "points" (f_1,f_2), and is mapped onto the hyperbolic line -infty<u<+infty by the ...
Consider a convex plane curve K with perimeter L, and the set of points P exterior to K. Further, let t_1 and t_2 be the perpendicular distances from P to K (with ...
A disk algebra is an algebra of functions which are analytic on the open unit disk in C and continuous up to the boundary. A representative measure for a point x in the ...
A hexahedral graph is a polyhedral graph on six vertices. There are seven distinct hexahedral graphs (illustrated above) which, through duality, correspond to seven convex ...
...
View search results from all Wolfram sites (2271 matches)

