References
- Ennis, C. (2016). (Always) room for one more. Math Horizons. 23(3): 8–12. DOI: 10.4169/mathhorizons.23.3.8.
- Ennis, C. (2020). Between the cracks: Filling space with polygonal shapes. Amer. Math. Monthly. 127(7): 602–616.
- Hayes, B. (2019). bit-player: An amateur’s guide to computation and mathematics. bit-player.org/2019/my-god-its-full-of-dots
- Senechal, M. (1981). Which Tetrahedra Fill Space? Math. Mag. 54(5): 227–243. DOI: 10.1080/0025570X.1981.11976933.
- Rényi, A. (1958). On a one-dimensional problem concerning random space-filling. Publ. Math. Inst. Hung. Acad. Sci. 3: 109–127.
- Shier, J. (2019). Fractalize That! A Visual Essay on Statistical Geometry. Hackensack, NJ: World Scientific.
- Shier, J., Bourke, P. (2013). An algorithm for random fractal filling of space. Computer Graphics Forum. 32(8): 89–97. DOI: 10.1111/cgf.12163.