April 2014
Beginner to intermediate
496 pages
9h 40m
English
book
Classical Geometry: Euclidean, Transformational, Inversive, and Projective
by I. E. Leonard, J. E. Lewis, A. C. F. Liu, G. W. Tokarsky
Content preview from Classical Geometry: Euclidean, Transformational, Inversive, and Projective
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
CHAPTER 12
TESSELLATIONS
12.1 Tilings
A tiling or tessellation of the plane is a division of the plane into regions
called tiles, in such a manner that:
1. No region contains an interior point of another region.
2. Every point in the plane belongs to one of the regions.
In other words, the plane is completely covered by nonoverlapping tiles.
There is no requirement that the tiles be related in any way, but our interest is primarily in tilings where there are only a finite number of differently shaped tiles. A tessellation is of order-k, or k-hedral, if there is a finite set of k incongruent tiles S such that:
1. Every tile in the tessellation is congruent to some member of S.
2. Every member of S occurs at least once in the tessellation.
The members of S are called prototiles, and we say that S tiles the plane. The tiling in the figure below has a set of three prototiles, so it is an order-3 tiling.
12.2 Monohedral Tilings
The most natural question is “Which polygons are monohedral prototiles?” The words monohedral, dihedral, and trihedral are commonly used as synonyms for 1-hedral, 2-hedral, and 3-hedral, respectively.
It is not difficult to see that every parallelogram tiles the plane, as in (a) below.
As a consequence, every triangle tiles the plane because two copies ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.