Fundamentals of Circle Packing and Computational Layouts

Spatial optimization and generative geometry play a vital role in modern computational design, data visualization, and creative coding. This text-based course introduces you to the core mathematics and logic behind circle packing, guiding you step by step from basic geometric definitions to functional layout algorithms. You will explore how tangency constraints, relaxation techniques, and hierarchical packing methods work together to produce balanced, efficient patterns. What you'll learn: - Understand core geometric terminology, tangency principles, and boundary constraints - Implement fundamental circle packing algorithms, including greedy placement and iterative relaxation - Apply collision detection and distance calculations to maintain clean geometric spacing - Build hierarchical and weighted packing structures based on data inputs - Optimize computational performance and handle edge-case overlaps - Explore modern generative layout workflows for design and data visualization The material begins with fundamental concepts and spatial terminology before advancing into practical algorithmic patterns and code-based implementation techniques. Designed for beginners in computational design and generative art, this course requires no prior advanced math background. Start reading today to master the foundations of generative circle packing.