Geometry Session 6: Classifying Triangles Activity Sheet
... We saw in Session 5 that symmetry can be used for classifying designs. We will try this for triangles. The activity sheet for sorting triangles has several triangles to classify, but instead of ...
... We saw in Session 5 that symmetry can be used for classifying designs. We will try this for triangles. The activity sheet for sorting triangles has several triangles to classify, but instead of ...
Apollonian network
In combinatorial mathematics, an Apollonian network is an undirected graph formed by a process of recursively subdividing a triangle into three smaller triangles. Apollonian networks may equivalently be defined as the planar 3-trees, the maximal planar chordal graphs, the uniquely 4-colorable planar graphs, and the graphs of stacked polytopes. They are named after Apollonius of Perga, who studied a related circle-packing construction.