DAB α - KSAintern
... to the coordinate-axes and contain the maximum point of the graph of fk(x). This rectangle is divided into two parts by the graph of fk(x). Calculate the areas of these two parts and determine the proportion of their areas. ...
... to the coordinate-axes and contain the maximum point of the graph of fk(x). This rectangle is divided into two parts by the graph of fk(x). Calculate the areas of these two parts and determine the proportion of their areas. ...
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.