Spirolateral
   HOME
*



picture info

Spirolateral
In Euclidean geometry, a spirolateral is a polygon created by a sequence of fixed vertex internal angles and sequential edge lengths 1,2,3,…,''n'' which repeat until the figure closes. The number of repeats needed is called its cycles. Gardner, M. ''Worm Paths'' Ch. 17 ''Knotted Doughnuts and Other Mathematical Entertainments'' New York: W. H. Freeman, pp. 205-221, 1986/ref> A ''simple spirolateral'' has only positive angles. A simple spiral approximates of a portion of an archimedean spiral. A ''general spirolateral'' allows positive and negative angles. A ''spirolateral'' which completes in one turn is a simple polygon, while requiring more than 1 turn is a star polygon and must be self-crossing. A simple spirolateral can be an equangular simple polygon with ''p'' vertices, or an equiangular star polygon with ''p'' vertices and ''q'' turns. Spirolaterals were invented and named by Frank C. Odds as a teenager in 1962, as ''square spirolaterals'' with 90° angles, drawn on gra ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Spirolateral 3 90
In Euclidean geometry, a spirolateral is a polygon created by a sequence of fixed vertex internal angles and sequential edge lengths 1,2,3,…,''n'' which repeat until the figure closes. The number of repeats needed is called its cycles.Martin Gardner, Gardner, M. ''Worm Paths'' Ch. 17 ''Knotted Doughnuts and Other Mathematical Entertainments'' New York: W. H. Freeman, pp. 205-221, 1986/ref> A ''simple spirolateral'' has only positive angles. A simple spiral approximates of a portion of an archimedean spiral. A ''general spirolateral'' allows positive and negative angles. A ''spirolateral'' which completes in one Turn (geometry), turn is a simple polygon, while requiring more than 1 turn is a star polygon and must be self-crossing. A simple spirolateral can be an equangular simple polygon with ''p'' vertices, or an equiangular star polygon with ''p'' vertices and ''q'' turns. Spirolaterals were invented and named by Frank C. Odds as a teenager in 1962, as ''square spirolaterals'' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Spirolateral 3 108
In Euclidean geometry, a spirolateral is a polygon created by a sequence of fixed vertex internal angles and sequential edge lengths 1,2,3,…,''n'' which repeat until the figure closes. The number of repeats needed is called its cycles. Gardner, M. ''Worm Paths'' Ch. 17 ''Knotted Doughnuts and Other Mathematical Entertainments'' New York: W. H. Freeman, pp. 205-221, 1986/ref> A ''simple spirolateral'' has only positive angles. A simple spiral approximates of a portion of an archimedean spiral. A ''general spirolateral'' allows positive and negative angles. A ''spirolateral'' which completes in one turn is a simple polygon, while requiring more than 1 turn is a star polygon and must be self-crossing. A simple spirolateral can be an equangular simple polygon with ''p'' vertices, or an equiangular star polygon with ''p'' vertices and ''q'' turns. Spirolaterals were invented and named by Frank C. Odds as a teenager in 1962, as ''square spirolaterals'' with 90° angles, drawn on gra ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Spirolateral 1-12-3432 60
In Euclidean geometry, a spirolateral is a polygon created by a sequence of fixed vertex internal angles and sequential edge lengths 1,2,3,…,''n'' which repeat until the figure closes. The number of repeats needed is called its cycles. Gardner, M. ''Worm Paths'' Ch. 17 ''Knotted Doughnuts and Other Mathematical Entertainments'' New York: W. H. Freeman, pp. 205-221, 1986/ref> A ''simple spirolateral'' has only positive angles. A simple spiral approximates of a portion of an archimedean spiral. A ''general spirolateral'' allows positive and negative angles. A ''spirolateral'' which completes in one turn is a simple polygon, while requiring more than 1 turn is a star polygon and must be self-crossing. A simple spirolateral can be an equangular simple polygon with ''p'' vertices, or an equiangular star polygon with ''p'' vertices and ''q'' turns. Spirolaterals were invented and named by Frank C. Odds as a teenager in 1962, as ''square spirolaterals'' with 90° angles, drawn on gra ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Spirolateral 9 90
In Euclidean geometry, a spirolateral is a polygon created by a sequence of fixed vertex internal angles and sequential edge lengths 1,2,3,…,''n'' which repeat until the figure closes. The number of repeats needed is called its cycles. Gardner, M. ''Worm Paths'' Ch. 17 ''Knotted Doughnuts and Other Mathematical Entertainments'' New York: W. H. Freeman, pp. 205-221, 1986/ref> A ''simple spirolateral'' has only positive angles. A simple spiral approximates of a portion of an archimedean spiral. A ''general spirolateral'' allows positive and negative angles. A ''spirolateral'' which completes in one turn is a simple polygon, while requiring more than 1 turn is a star polygon and must be self-crossing. A simple spirolateral can be an equangular simple polygon with ''p'' vertices, or an equiangular star polygon with ''p'' vertices and ''q'' turns. Spirolaterals were invented and named by Frank C. Odds as a teenager in 1962, as ''square spirolaterals'' with 90° angles, drawn on gra ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Spirolateral 2-3-4-90
In Euclidean geometry, a spirolateral is a polygon created by a sequence of fixed vertex internal angles and sequential edge lengths 1,2,3,…,''n'' which repeat until the figure closes. The number of repeats needed is called its cycles. Gardner, M. ''Worm Paths'' Ch. 17 ''Knotted Doughnuts and Other Mathematical Entertainments'' New York: W. H. Freeman, pp. 205-221, 1986/ref> A ''simple spirolateral'' has only positive angles. A simple spiral approximates of a portion of an archimedean spiral. A ''general spirolateral'' allows positive and negative angles. A ''spirolateral'' which completes in one turn is a simple polygon, while requiring more than 1 turn is a star polygon and must be self-crossing. A simple spirolateral can be an equangular simple polygon with ''p'' vertices, or an equiangular star polygon with ''p'' vertices and ''q'' turns. Spirolaterals were invented and named by Frank C. Odds as a teenager in 1962, as ''square spirolaterals'' with 90° angles, drawn on gra ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Spirolateral 100 120
In Euclidean geometry, a spirolateral is a polygon created by a sequence of fixed vertex internal angles and sequential edge lengths 1,2,3,…,''n'' which repeat until the figure closes. The number of repeats needed is called its cycles.Martin Gardner, Gardner, M. ''Worm Paths'' Ch. 17 ''Knotted Doughnuts and Other Mathematical Entertainments'' New York: W. H. Freeman, pp. 205-221, 1986/ref> A ''simple spirolateral'' has only positive angles. A simple spiral approximates of a portion of an archimedean spiral. A ''general spirolateral'' allows positive and negative angles. A ''spirolateral'' which completes in one Turn (geometry), turn is a simple polygon, while requiring more than 1 turn is a star polygon and must be self-crossing. A simple spirolateral can be an equangular simple polygon with ''p'' vertices, or an equiangular star polygon with ''p'' vertices and ''q'' turns. Spirolaterals were invented and named by Frank C. Odds as a teenager in 1962, as ''square spirolaterals'' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Spirolateral 112-1-1-2 90
In Euclidean geometry, a spirolateral is a polygon created by a sequence of fixed vertex internal angles and sequential edge lengths 1,2,3,…,''n'' which repeat until the figure closes. The number of repeats needed is called its cycles. Gardner, M. ''Worm Paths'' Ch. 17 ''Knotted Doughnuts and Other Mathematical Entertainments'' New York: W. H. Freeman, pp. 205-221, 1986/ref> A ''simple spirolateral'' has only positive angles. A simple spiral approximates of a portion of an archimedean spiral. A ''general spirolateral'' allows positive and negative angles. A ''spirolateral'' which completes in one turn is a simple polygon, while requiring more than 1 turn is a star polygon and must be self-crossing. A simple spirolateral can be an equangular simple polygon with ''p'' vertices, or an equiangular star polygon with ''p'' vertices and ''q'' turns. Spirolaterals were invented and named by Frank C. Odds as a teenager in 1962, as ''square spirolaterals'' with 90° angles, drawn on gra ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Spirolateral -1 2 60
In Euclidean geometry, a spirolateral is a polygon created by a sequence of fixed vertex internal angles and sequential edge lengths 1,2,3,…,''n'' which repeat until the figure closes. The number of repeats needed is called its cycles. Gardner, M. ''Worm Paths'' Ch. 17 ''Knotted Doughnuts and Other Mathematical Entertainments'' New York: W. H. Freeman, pp. 205-221, 1986/ref> A ''simple spirolateral'' has only positive angles. A simple spiral approximates of a portion of an archimedean spiral. A ''general spirolateral'' allows positive and negative angles. A ''spirolateral'' which completes in one turn is a simple polygon, while requiring more than 1 turn is a star polygon and must be self-crossing. A simple spirolateral can be an equangular simple polygon with ''p'' vertices, or an equiangular star polygon with ''p'' vertices and ''q'' turns. Spirolaterals were invented and named by Frank C. Odds as a teenager in 1962, as ''square spirolaterals'' with 90° angles, drawn on gra ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Spirolateral 6 90-fill
In Euclidean geometry, a spirolateral is a polygon created by a sequence of fixed vertex internal angles and sequential edge lengths 1,2,3,…,''n'' which repeat until the figure closes. The number of repeats needed is called its cycles. Gardner, M. ''Worm Paths'' Ch. 17 ''Knotted Doughnuts and Other Mathematical Entertainments'' New York: W. H. Freeman, pp. 205-221, 1986/ref> A ''simple spirolateral'' has only positive angles. A simple spiral approximates of a portion of an archimedean spiral. A ''general spirolateral'' allows positive and negative angles. A ''spirolateral'' which completes in one turn is a simple polygon, while requiring more than 1 turn is a star polygon and must be self-crossing. A simple spirolateral can be an equangular simple polygon with ''p'' vertices, or an equiangular star polygon with ''p'' vertices and ''q'' turns. Spirolaterals were invented and named by Frank C. Odds as a teenager in 1962, as ''square spirolaterals'' with 90° angles, drawn on gra ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Equiangular Polygon
In Euclidean geometry, an equiangular polygon is a polygon whose vertex angles are equal. If the lengths of the sides are also equal (that is, if it is also equilateral) then it is a regular polygon. Isogonal polygons are equiangular polygons which alternate two edge lengths. For clarity, a planar equiangular polygon can be called ''direct'' or ''indirect''. A direct equiangular polygon has all angles turning in the same direction in a plane and can include multiple turns. Convex equiangular polygons are always direct. An indirect equiangular polygon can include angles turning right or left in any combination. A skew equiangular polygon may be isogonal, but can't be considered direct since it is nonplanar. A spirolateral ''n''θ is a special case of an ''equiangular polygon'' with a set of ''n'' integer edge lengths repeating sequence until returning to the start, with vertex internal angles θ. Construction An ''equiangular polygon'' can be constructed from a regula ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Golygon
A golygon, or more generally a serial isogon of 90°, is any polygon with all right angles (a rectilinear polygon) whose sides are consecutive integer lengths. Golygons were invented and named by Lee Sallows, and popularized by A.K. Dewdney in a 1990 ''Scientific American'' column (Smith). Variations on the definition of golygons involve allowing edges to cross, using sequences of edge lengths other than the consecutive integers, and considering turn angles other than 90°. Properties In any golygon, all horizontal edges have the same parity as each other, as do all vertical edges. Therefore, the number ''n'' of sides must allow the solution of the system of equations :\pm 1 \pm 3 \pm \cdots \pm (n-1) = 0 :\pm 2 \pm 4 \pm \cdots \pm n = 0. It follows from this that ''n'' must be a multiple of 8. For example, in the figure we have -1 + 3 + 5 - 7 = 0 and 2 - 4 - 6 + 8 = 0. The number of golygons for a given permissible value of ''n'' may be computed efficiently using generating f ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Golygon
A golygon, or more generally a serial isogon of 90°, is any polygon with all right angles (a rectilinear polygon) whose sides are consecutive integer lengths. Golygons were invented and named by Lee Sallows, and popularized by A.K. Dewdney in a 1990 ''Scientific American'' column (Smith). Variations on the definition of golygons involve allowing edges to cross, using sequences of edge lengths other than the consecutive integers, and considering turn angles other than 90°. Properties In any golygon, all horizontal edges have the same parity as each other, as do all vertical edges. Therefore, the number ''n'' of sides must allow the solution of the system of equations :\pm 1 \pm 3 \pm \cdots \pm (n-1) = 0 :\pm 2 \pm 4 \pm \cdots \pm n = 0. It follows from this that ''n'' must be a multiple of 8. For example, in the figure we have -1 + 3 + 5 - 7 = 0 and 2 - 4 - 6 + 8 = 0. The number of golygons for a given permissible value of ''n'' may be computed efficiently using generating f ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]