Warning: Some posts on this platform may contain adult material intended for mature audiences only. Viewer discretion is advised. By clicking ‘Continue’, you confirm that you are 18 years or older and consent to viewing explicit content.
Want a hint? Think about a circle bound by an n-sided polygon. What happens to the space between the bounding polygon and the circle as n increases? And when n is infinite?
So of three possible regular tilings, which will be most and least efficient?
(Btw, strictly speaking, I shouldn’t have said tri/hex before, as it’s really just hex tiling.)
You could also use some fancy trig to calculate the efficiency %, but that’s way too much work for me. :)
Trying to think how tri/hex is more efficient than any regular tiling, say squares.
Want a hint? Think about a circle bound by an n-sided polygon. What happens to the space between the bounding polygon and the circle as n increases? And when n is infinite?
So of three possible regular tilings, which will be most and least efficient?
(Btw, strictly speaking, I shouldn’t have said tri/hex before, as it’s really just hex tiling.)
You could also use some fancy trig to calculate the efficiency %, but that’s way too much work for me. :)