A star is made by taking the vertices (corners) of a polygon and joining them up in a regular way which involves cutting across the body of the polygon.
The 'rules' for making a stellation of a polygon are as follows:
Pentagonal StarHere is the code for a pentagonal star. Triangles and squares won't produce regular stellations(Why?). cs ht repeat 5 [forward 120 right 360*2/5] This works as follows:
| |||||||||||||||||||||||
Drawing the Star |
Heptagonal StarsThe heptagon has two distinct stellations. | ||||||||||||||||||||||
Nine Pointscs ht repeat 9 [fd 200 rt 360*2/9] |
Eleven Pointscs ht repeat 11 [fd 200 rt 360*5/11] Thirty One Pointscs ht repeat 31 [fd 200 rt 360*13/31] | ||||||||||||||||||||||
TasksComplete this table to show how many stellations there are for different polygons. Fill in the number of vertices and the start numbers which produce proper stellations. The first few rows have been done for you.
|
QuestionsWhy do some polygons allow stellations and not others? Why do some polygons have more than one stellation? Why are there some start numbers that don't work for a given polygon? Which start numbers would produce stellations for a 19 sided polygon? Harder TasksWrite down the vertex order for the stellations of the heptagon. How does the start number relate to the number of orbits that you must make around the polygon before returning to the origin? How could you use stellation to test for prime numbers? What is the connection between the vertex number, the start number and their LCM (lowest common multiple)? Fun TasksUse 'Print Screen' to drop your stellation into 'Paint' and then colour it in. |
This program draws a polygon and then links all the vertices together to form a complex pattern. This pattern is actually a superposition of all the star patterns possible for that polygon.
The programOpen Logo and the procedure editor. Copy and paste this code in and then save and exit.
to rose :verts Call the procedure with the command line code: rose 11 |
|
In general terms the star polygons can be described using the notation (p/q) where p and q are positive
integers which are usually co-prime. p is the number of vertices of the polygon and q is the vertex, counting from 0 to which the first line is drawn. If p and q have a common factor then the stellation will not visit all the vertices. To overcome this the stellation can be rotated until all the vertices have been visited. This will result in patterns like the Star of David etc. This exercise can also be thought of in terms of modular arithmetic. Stellation (10/3) requires three orbits to return to its origin (10mod3=1). Each orbit in effect performs a modular division. Stellation (10/2) produces a pentagon as 10mod5=0. To produce a stellation from (10/2) it is necessary to draw the pattern once and then rotate to the unvisited vertices. |
Last updated 7th March 2008