Geometry — page 2

Every turn that leaves a cube where it was. A cube in wireframe beside a table of its rotation axes: 3 of order 4, 4 of order 3, 6 of order 2, totalling 24 turns including the one that does nothing.

The five solids as three groups

There are five regular solids and only three groups of rotations between them, because a solid and its dual share their symmetries exactly. The largest of the three is the smallest group with no way of coming apart, which is why the general equation of the fifth degree has no formula.

Eight circles touching three

Draw three circles. How many circles touch all three? The answer is eight, the count is a fact about signs rather than about geometry, and the classical way to find them is to move the problem somewhere it becomes easy.

An Apollonian gasket, 125 circles in. The Apollonian gasket generated from four mutually tangent circles of curvature −1, 2, 2 and 3, drawn to 4 generations; every curvature in it is a whole number.

Curvatures that stay whole

Four circles touching one another satisfy an equation in their curvatures. Read it as a quadratic and the second solution is the first subtracted from something — so a packing that starts with whole numbers stays whole forever.

The number four points agree on

One inversion is a reflection and reverses orientation. Two of them compose to a motion, and what that motion leaves alone is a single number computed from any four points.

Nineteen circles, one per vertex. A circle packing of a triangulation with seven interior vertices and twelve on the boundary: two circles touch exactly when their vertices are joined, and the radii were solved for rather than chosen.

Every flat graph is a pile of circles

A graph that can be drawn without crossings can be drawn in one particular way: as circles, one per vertex, touching exactly when their vertices are joined. The picture is not a choice — it is determined, up to the group two inversions generate.

The triangulation as the underside of a hull. Eight points on a floor, lifted onto a paraboloid above them. The faces of the lifted set's lower convex hull are shaded, and their shadows on the floor are the Delaunay triangulation of the original points.

One dimension up, and the circles disappear

The Delaunay triangulation is defined by a condition about circles, which is awkward to compute and awkward to reason about. Lift every point onto a paraboloid and the circles turn into planes, the condition turns into convexity, and a two-dimensional problem is solved by looking at a three-dimensional shape from underneath.

A scatter walking towards its own centres. 4 panels of the same 24 sites: the initial clumpy scatter and the Voronoi diagram after 1, 3, 12 rounds of Lloyd's iteration, with the cost falling to 52% of the scatter's as the cells even out.

Every site in the middle of its own cell

Move each point to the centre of mass of its own Voronoi cell, then redraw the diagram, then do it again. The rule is two lines long, it never mentions hexagons, and what it settles into is a honeycomb.

When the sites are not the same size

Give every site a weight and the boundaries slide. The cells stay convex and the edges stay straight, which is surprising, and one thing happens that the unweighted diagram never allows — a site can end up owning nothing at all.

The shortest tree was already in the triangulation. The Delaunay triangulation of 20 sites in faint lines with the minimum spanning tree drawn over it in heavy ones. Every tree edge is a triangulation edge, and the circles on the longest few tree edges as diameters contain no other site.

The tree inside the triangulation

The shortest network joining a set of points is built from edges chosen by length, and the triangulation is built from edges chosen by an emptiness condition about circles. The two constructions share no step, and every edge of the first is an edge of the second.

The two numbers that make up a width. A Reuleaux polygon with 3 sides, its centre marked as the origin, and the two supporting lines with normals 33° and 213°. The perpendicular distances from the origin to the two lines are marked; they add to the width.

The shape described from outside

A convex shape can be given by its boundary or by the family of lines that touch it, and the second description turns the constant-width condition into one line of arithmetic — after which the perimeter falls out, and curves with no corners at all can simply be written down.

Area at equal width: the triangle least, the circle most. A bar for each curve of constant width the family draws, all at the same width, with the bar's length its enclosed area and the extremes marked.

The least area a width can hold

Barbier's theorem says every curve of constant width has the same perimeter, which removes perimeter as a way of telling the family apart. Area is not like that — the circle holds the most and the Reuleaux triangle the least — and the reason the minimiser has corners is a constraint rather than a preference.

The Reuleaux tetrahedron's width runs from 2.83 to 2.9. The largest and smallest width of the intersection of four balls, plotted against the polar angle of the measuring direction, with the constant width it would need to have drawn flat.

The same question in space

Intersect four balls at the corners of a tetrahedron and the result is not of constant width — it misses by two and a half per cent, computed exactly. Repairing it gives a body that is, and whether that body is the smallest of its kind has been open for a century.

Every ray aimed at one focus is turned towards the other. A hyperbola with its two foci and 13 rays aimed at the far one. Each strikes the near branch from outside and is turned towards the near focus — which is the property a Cassegrain telescope's secondary mirror uses.

Aimed at one focus, turned towards the other

An ellipse sends every ray leaving one focus through the other. A hyperbola does something that sounds like the same sentence and is not — it takes a ray aimed at the far focus and turns it towards the near one, which is what the second mirror of a telescope is for.

Two families of conics, crossing at right angles. 4 ellipses and 3 hyperbolas with the same pair of foci. Every ellipse meets every hyperbola at a right angle, checked at all 12 crossings.

Two families that cross at right angles

Fix two points and draw every ellipse with those foci, then every hyperbola with the same two. Each curve of the first family meets each of the second at a right angle, so between them they are a coordinate system — and the reason is one sentence about angle bisectors.

One sign decides which curve

The general quadratic in two variables has six coefficients and draws a conic. Which of the four it draws is settled by a single combination of three of them, and the other three cannot change the answer however they are chosen.