Search results

From Hi.gher. Space

Create the page "Regular polygons" on this wiki!

  • Platonic solids
    <[#ontology [kind topic] [cats Essays Regular Polytope]]> == The Regular Polyhedra ==
    2 KB (362 words) - 21:46, 11 February 2014
  • Polytope
    ...dimensional polytopes. Polytopes are grouped by their dimension into the ''polygons'', ''polyhedra'', ''polychora'', ''polytera'', ''polypeta'', etc. ...exed by their [[Bowers acronym]] or [[Kana mnemonic]]. See also [[Table of regular polytopes by elemental name]] and [[List of uniform polychora]].
    3 KB (392 words) - 13:09, 15 March 2014
  • Hexagon
    <[#ontology [kind topic] [cats 2D Regular Polytope] [alt [[freebase:0g85j]] [[wikipedia:Hexagon]]]]> ...d polygon. It is also the truncated [[triangle]]. It is one of the regular polygons that can tile the plain.
    1 KB (204 words) - 14:56, 26 March 2017
  • Xylochoron
    <[#ontology [kind topic] [cats 4D Regular Polytope]]> ...r, convex, [[self-dual]] polytope that isn't also a [[simplex]], besides [[regular]] [[polygon]]s in 2D. A self-dual polytope is one where if you reverse the
    7 KB (1,077 words) - 14:26, 26 March 2017
  • Triangle
    Triangles are one of the three regular polygons that can tile the plain, forming the [[triangular tiling]].
    2 KB (207 words) - 10:40, 26 March 2017
  • Duoprism
    A '''duoprism''' is the Cartesian product of two polygons. In other words, it is the set of all combinations of points (w,x,y,z) wher The duoprism is convex if the two source polygons are convex.
    2 KB (398 words) - 19:54, 8 February 2014
  • SSC2
    === Regular polygons === [[Regular polygon]]s are written in the form Gx, where x is the number of vertices in
    11 KB (1,890 words) - 20:11, 8 February 2014
  • Dimensional Features Summary
    ...re there are an infinite number of [[regular polytope]]s; in this case the regular [[polygon]]s. *There are only five regular polytopes in this dimension.
    11 KB (1,862 words) - 20:00, 30 October 2017
  • CRF
    * All its 2-dimensional elements are [[regular polygon]]s. All regular and uniform polytopes in all dimensions are CRF.
    2 KB (277 words) - 20:54, 4 July 2016

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)