23.02.2014 Views

Shape

Shape

Shape

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

121 A Second Look at Calculating<br />

For example, if I go on drawing and extend the lines in each of the stars in the<br />

series<br />

so that every two lines intersect—no two are parallel and no three share a point—then<br />

I get the corresponding superstars in this series<br />

Only the five-pointed star is both a star and a superstar—five lines intersect in ten<br />

points. But all of the others stars have greater potential as superstars. For 2n 1 lines,<br />

there are 2n 2 3n þ 1 intersections. And I can count in additional ways, too. For example,<br />

every superstar is made up of n 1 concentric shells—you can think of them as<br />

orbits—and 2n 1 intersections lie in each. Moreover, anywhere I look, 2n 2 intersections<br />

are on a line. It’s all pretty neat. Still, some things about superstars are far easier<br />

to see than to count. Let’s try—it turns out to be even neater with a host of real<br />

surprises.<br />

Novel behavior is common when polygons interact. With stars, it’s two polygons,<br />

and with superstars, it’s two or more. In fact, there can be a cast of thousands<br />

that changes dramatically. It’s a question of what I see as I calculate. Suppose I define<br />

rules according to the schema<br />

x fi tðxÞ<br />

so that x is any chevron and the transformation t keeps shapes similar—or congruent if<br />

you want. Then I have rules like this one<br />

that I can apply recursively to separate chevrons and superstars in the following<br />

manner

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!