Stella (software)
   HOME
*



picture info

Stella (software)
Stella, a computer program available in three versions (Great Stella, Small Stella and Stella4D), was created by Robert Webb of Australia. The programs contain a large library of polyhedra which can be manipulated and altered in various ways. Polyhedra Polyhedra in Great Stella's library include the Platonic solids, the Archimedean solids, the Kepler-Poinsot solids, the Johnson solids, some Johnson Solid near-misses, numerous compounds including the uniform polyhedra, and other polyhedra. Operations which can be performed on these polyhedra include stellation, faceting, augmentation, dualization (also called "reciprocation"), creating convex hulls, and others. All versions of the program enable users to print nets for polyhedra. These nets may then be assembled into actual three-dimensional polyhedral models of great beauty and complexity. Stella4D In 2007, a Stella4D version was added, allowing the generation and display of four-dimensional polytopes ( polychora), i ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Great Stella (software) Screenshot
Great may refer to: Descriptions or measurements * Great, a relative measurement in physical space, see Size * Greatness, being divine, majestic, superior, majestic, or transcendent People * List of people known as "the Great" *Artel Great (born 1981), American actor Other uses * ''Great'' (1975 film), a British animated short about Isambard Kingdom Brunel * ''Great'' (2013 film), a German short film * Great (supermarket), a supermarket in Hong Kong * GReAT, Graph Rewriting and Transformation, a Model Transformation Language * Gang Resistance Education and Training Gang Resistance Education And Training, abbreviated G.R.E.A.T., provides a school-based, police officer instructed program that includes classroom instruction and various learning activities. Their intention is to teach the students to avoid gang ..., or GREAT, a school-based and police officer-instructed program * Global Research and Analysis Team (GReAT), a cybersecurity team at Kaspersky Lab *'' Great!'', a 20 ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Convex Hull
In geometry, the convex hull or convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all convex combinations of points in the subset. For a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around the subset. Convex hulls of open sets are open, and convex hulls of compact sets are compact. Every compact convex set is the convex hull of its extreme points. The convex hull operator is an example of a closure operator, and every antimatroid can be represented by applying this closure operator to finite sets of points. The algorithmic problems of finding the convex hull of a finite set of points in the plane or other low-dimensional Euclidean spaces, and its dual problem of intersecting half-spaces, are fundamental problems of com ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Polyhedra
In geometry, a polyhedron (plural polyhedra or polyhedrons; ) is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices. A convex polyhedron is the convex hull of finitely many points, not all on the same plane. Cubes and pyramids are examples of convex polyhedra. A polyhedron is a 3-dimensional example of a polytope, a more general concept in any number of dimensions. Definition Convex polyhedra are well-defined, with several equivalent standard definitions. However, the formal mathematical definition of polyhedra that are not required to be convex has been problematic. Many definitions of "polyhedron" have been given within particular contexts,. some more rigorous than others, and there is not universal agreement over which of these to choose. Some of these definitions exclude shapes that have often been counted as polyhedra (such as the self-crossing polyhedra) or include shapes that are often not considered as valid polyhed ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Today (Australian TV Program)
''Today'' (also referred to as ''The Today Show'') is an Australian breakfast television program, with an infotainment base, currently hosted by Karl Stefanovic and Sarah Abo and includes news and weather updates. It broadcast weekdays on the Nine Network. The show also has a weekend edition called ''Weekend Today'' ''Today'' airs each weekday after '' Nine News: Early Edition'' and runs from 5:30 am to 9:00 am before ''Today Extra'', an extended light entertainment program, hosted by David Campbell and Sylvia Jeffreys. The show is broadcast from the Nine Network TCN studios in North Sydney, a suburb located on the North Shore of New South Wales. Although not affiliated with, the program shares a similiar infotainment format and title of the long running United States. History Officially launched as The National Today Show, ''Today'' is Australia's longest running morning breakfast news program. The show premiered on 28 June 1982. The original hosts, Steve Liebmann and S ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


PC Plus
''PC Plus'' was a computer magazine published monthly from 1986 until September 2012 in the UK by Future plc. The magazine was aimed at intermediate to advanced PC users, computer professionals and enthusiasts. The magazine was specifically for users of PCs and related technologies so features articles were undiluted by coverage of other platforms. It began its life specifically as a magazine aimed at the Amstrad PC user. Staff For many years, the editor (later editor-in-chief) was Dave Pearman. PC Plus print magazine was closed in October 2012, when the editor was Martin Cooper. Each edition of the print magazine was centered on four main sections - news, reviews, features, and tutorials. Under Pearman's editorship, the magazine was characterised by the inclusion of irreverent off-the-wall features and content including Huw Collingbourne's Rants and Raves, a serialisation of a fictional office entitled Group Efforts and the Bastard Operator From Hell The Bastard Op ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Dual (polyhedron)
In geometry, every polyhedron is associated with a second dual structure, where the vertices of one correspond to the faces of the other, and the edges between pairs of vertices of one correspond to the edges between pairs of faces of the other. Such dual figures remain combinatorial or abstract polyhedra, but not all can also be constructed as geometric polyhedra. Starting with any given polyhedron, the dual of its dual is the original polyhedron. Duality preserves the symmetries of a polyhedron. Therefore, for many classes of polyhedra defined by their symmetries, the duals belong to a corresponding symmetry class. For example, the regular polyhedrathe (convex) Platonic solids and (star) Kepler–Poinsot polyhedraform dual pairs, where the regular tetrahedron is self-dual. The dual of an isogonal polyhedron (one in which any two vertices are equivalent under symmetries of the polyhedron) is an isohedral polyhedron (one in which any two faces are equivalent .., and vice vers ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Faceting
Stella octangula as a faceting of the cube In geometry, faceting (also spelled facetting) is the process of removing parts of a polygon, polyhedron or polytope, without creating any new Vertex (geometry), vertices. New edges of a faceted polyhedron may be created along face diagonals or internal space diagonals. A ''faceted polyhedron'' will have two faces on each edge and creates new polyhedra or compounds of polyhedra. Faceting is the reciprocal or duality (mathematics), dual process to ''stellation''. For every stellation of some convex polytope, there exists a dual faceting of the dual polytope. Faceted polygons For example, a regular pentagon has one symmetry faceting, the pentagram, and the regular hexagon has two symmetric facetings, one as a polygon, and one as a compound of two triangles. Faceted polyhedra The regular icosahedron can be faceted into three regular Kepler–Poinsot polyhedron, Kepler–Poinsot polyhedra: small stellated dodecahedron, great dodecah ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Vertex Figure
In geometry, a vertex figure, broadly speaking, is the figure exposed when a corner of a polyhedron or polytope is sliced off. Definitions Take some corner or Vertex (geometry), vertex of a polyhedron. Mark a point somewhere along each connected edge. Draw lines across the connected faces, joining adjacent points around the face. When done, these lines form a complete circuit, i.e. a polygon, around the vertex. This polygon is the vertex figure. More precise formal definitions can vary quite widely, according to circumstance. For example Coxeter (e.g. 1948, 1954) varies his definition as convenient for the current area of discussion. Most of the following definitions of a vertex figure apply equally well to infinite tessellation, tilings or, by extension, to Honeycomb (geometry), space-filling tessellation with polytope Cell (geometry), cells and other higher-dimensional polytopes. As a flat slice Make a slice through the corner of the polyhedron, cutting through all the edges ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Uniform 4-polytope
In geometry, a uniform 4-polytope (or uniform polychoron) is a 4-dimensional polytope which is vertex-transitive and whose cells are uniform polyhedra, and faces are regular polygons. There are 47 non-prismatic convex uniform 4-polytopes. There are two infinite sets of convex prismatic forms, along with 17 cases arising as prisms of the convex uniform polyhedra. There are also an unknown number of non-convex star forms. History of discovery * Convex Regular polytopes: ** 1852: Ludwig Schläfli proved in his manuscript ''Theorie der vielfachen Kontinuität'' that there are exactly 6 regular polytopes in 4 dimensions and only 3 in 5 or more dimensions. * Regular star 4-polytopes (star polyhedron cells and/or vertex figures) ** 1852: Ludwig Schläfli also found 4 of the 10 regular star 4-polytopes, discounting 6 with cells or vertex figures and . ** 1883: Edmund Hess completed the list of 10 of the nonconvex regular 4-polytopes, in his book (in German) ''Einleitung in die Leh ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

4-polytope
In geometry, a 4-polytope (sometimes also called a polychoron, polycell, or polyhedroid) is a four-dimensional polytope. It is a connected and closed figure, composed of lower-dimensional polytopal elements: vertices, edges, faces (polygons), and cells (polyhedra). Each face is shared by exactly two cells. The 4-polytopes were discovered by the Swiss mathematician Ludwig Schläfli before 1853. The two-dimensional analogue of a 4-polytope is a polygon, and the three-dimensional analogue is a polyhedron. Topologically 4-polytopes are closely related to the uniform honeycombs, such as the cubic honeycomb, which tessellate 3-space; similarly the 3D cube is related to the infinite 2D square tiling. Convex 4-polytopes can be ''cut and unfolded'' as nets in 3-space. Definition A 4-polytope is a closed four-dimensional figure. It comprises vertices (corner points), edges, faces and cells. A cell is the three-dimensional analogue of a face, and is therefore a polyhedron. Each fa ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Polyhedron Model
A polyhedron model is a physical construction of a polyhedron, constructed from cardboard, plastic board, wood board or other panel material, or, less commonly, solid material. Since there are 75 uniform polyhedra, including the five regular convex polyhedra, five polyhedral compounds, four Kepler-Poinsot polyhedra, and thirteen Archimedean solids, constructing or collecting polyhedron models has become a common mathematical recreation. Polyhedron models are found in mathematics classrooms much as globes in geography classrooms. Polyhedron models are notable as three-dimensional proof-of-concepts of geometric theories. Some polyhedra also make great centerpieces, tree toppers, Holiday decorations, or symbols. The Merkaba religious symbol, for example, is a stellated octahedron. Constructing large models offer challenges in engineering structural design. Construction Construction begins by choosing a ''size'' of the model, either the ''length'' of its edges or the ''heigh ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Net (polyhedron)
In geometry, a net of a polyhedron is an arrangement of non-overlapping edge-joined polygons in the plane which can be folded (along edges) to become the faces of the polyhedron. Polyhedral nets are a useful aid to the study of polyhedra and solid geometry in general, as they allow for physical models of polyhedra to be constructed from material such as thin cardboard. An early instance of polyhedral nets appears in the works of Albrecht Dürer, whose 1525 book ''A Course in the Art of Measurement with Compass and Ruler'' (''Unterweysung der Messung mit dem Zyrkel und Rychtscheyd '') included nets for the Platonic solids and several of the Archimedean solids. These constructions were first called nets in 1543 by Augustin Hirschvogel. Existence and uniqueness Many different nets can exist for a given polyhedron, depending on the choices of which edges are joined and which are separated. The edges that are cut from a convex polyhedron to form a net must form a spanning tree of t ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]