Wiki · Arcology history · Principles · Packing
Wiki Arcology history · Principles · Packing
How volume is tiled, and how rooms join — Earth geometry for a city that cannot sprawl.
Earth mathematics and published megastructure concepts, framed for 2490 readers. Not a recovered Concordia grid. Play terms stay on Rooms, floors & maps.
A street grid of squares is easy to survey. It is not the densest way to pack equal cells, and it is not the kindest way to carry wind or quake through a joint. Stacked orthogonal rooms leave awkward leftover volume at corners and crossings. Steel that meets at right angles concentrates stress in a few members. Earth high-rises already cheat this with cores, outriggers, and setbacks; a true megastructure drawing usually cheats harder.
Hugh Ferriss’s 1929 charcoal ziggurats are a legal diagram as much as a dream: New York setback law turned into mass. They are ancestor drawings, not packing proofs. See Paper cities.
Hexagons tile a plane without gaps. Bees did not invent civic architecture, but engineers keep returning to hexagonal cells because they enclose area with less perimeter than squares of the same useful floor. King Camp Gillette’s The Human Drift (1894) already drew hexagonal halls beside Niagara — a paper city, not a proof, and not Concordia. In three dimensions the problem is richer: space-filling polyhedra, trusses, and irregular cells all appear in later computational design.
Sphere packing is a different theorem (Kepler’s conjecture, now a theorem). It is sometimes borrowed as a metaphor for “how many rooms fit.” Treat the metaphor as a metaphor. People are not spheres, and corridors are not voids between cannonballs.
A Voronoi tessellation assigns every point in a field to the nearest seed. The resulting cells are irregular polygons (or polyhedra) that hug their generators. Architects and landscape designers on Earth already use Voronoi diagrams to scatter courts, light wells, and structural nodes so that no region is stranded far from a shaft or a garden. The math is nineteenth-century (Dirichlet, Voronoi); the CAD habit is late-twentieth and twenty-first.
A city-scale Voronoi megastructure — every dwelling a cell in one computed foam — remains a sketch. 2490 readers can study the diagram without being told that Section 0 was generated that way. It was not published as Concordia’s method.
A solid mile of facade is a sail. The Shimizu Mega-City Pyramid, proposed in 2004 for Tokyo Bay as a home for a million people, was drawn as an open mega-truss so typhoon wind and water could pass through rather than take the structure as a wall. That proposal was not built. It is useful as a dated Earth concept: permeability as survival, not as decoration.
Sant’Elia’s 1914 lifts and skybridges already guessed that a thick city would need voids. Voids for light and wind are cousins. Climate shape in more detail: Climate and site.
Once rooms exist, the question is how they join. Graph theory treats doors and corridors as edges, rooms as nodes. Shortest-path algorithms (Dijkstra; later A*) are Earth tools for asking whether a clinic is too far from a dense hall, or whether a single stair is a choke. In a 2-D city you can widen a road. In a 3-D envelope, volume is the budget; a jam is a life-support event as well as a delay.
Published pedestrian research also talks about redundant egress: more than one disjoint path out of a crowded node. That is fire-code thinking, not a public recipe for how Concordia would seal a wing. Mathematics of crowds: Crowd flow.
It is not a license to rename play space. Microcell, subcell, block, room, page plot, plate, Floor, elevator-as-room remain the play terms. “Modular nodes,” “room transition logic,” and “server synchronization” are not glossary entries here. Odelo is not Soleri. The Laser District is not a Voronoi demo.
Parent: Principles. Closed loops: Ecology. Graphs and control: Mathematics.