Indira Lara Chatterji has some nice open-licensed animated gifs of concepts in low-dimensional geometry and topology at https://math.unice.fr/~indira/Mygifs.html

This is one of them, unzipping a 2-torus.

Triangle dissection, no shared edges: https://math.stackexchange.com/questions/1819928/triangle-dissection-no-shared-edges

(the intended target of a recent broken link from mathpuzzle.com)

The question is how to divide a triangle into smaller triangles, no two sharing a whole edge, but the solutions shown also have no separating triangles and a straight angle at each interior vertex. Double-counting angles and combining with Euler shows that, with these conditions, \(F=V-1\). Do all internally-4-connected planar graphs with \(F=V-1\) work?

Square packing: http://www.adamponting.com/square-packing/

Adam Ponting found a way to cover arbitrarily large (e.g. as measured by inradius) contiguous patches of the plane by distinct squares of sizes from \(1\) to \((2n+1)^2\), for any \(n\). Via https://demonstrations.wolfram.com/PontingSquarePacking/ and http://www.mathpuzzle.com/

Computer scientists say they’ve solved the mystery of the orb in Leonardo da Vinci’s _Salvator Mundi_: https://news.artnet.com/art-world/scientists-solve-mystery-salvator-mundi-orb-1745037

My colleague and co-author Mike Goodrich has been working with computer graphics specialists to model the refraction in the clear ball (representing the universe) held by Jesus in Leonardo's painting. Their work shows that the model that Leonardo painted from was likely a hollow glass ball, not a solid crystal. Original paper: https://arxiv.org/abs/1912.03416

How few \(k\)-gons can make a polyhedron, for different choices of \(k\)?https://math.stackexchange.com/questions/2869725/minimal-surfaces-for-planar-octagons-and-nonagons

The answers include an amazing high-genus polyhedron with 12 faces, each of which is an 11-gon, posted Nov 2018 by Ivan Neretin (sadly, with multiple adjacencies for some pairs of faces, dubious by some definitions of polyhedra, rather than having one edge per face pair).

Via http://www.mathpuzzle.com/ and indirectly via https://mathstodon.xyz/@christianp/103425156116096450

Geometric collages by Augustine Kofie: https://www.thisiscolossal.com/2015/11/collages-augustine-kofie/

More at https://augustinekofie.info/

Continuing the new articles related to my revision of the Wikipedia convex hull article, here's one on relative convex hulls: https://en.wikipedia.org/wiki/Relative_convex_hull

These are the shapes you get by stretching a rubber band around one set (here, some blue points) while fencing it inside another set (the yellow polygon). As you can see, even for points inside a polygon, you don't always get a simple polygon as a result, but it's "weakly simple".

Convex hull of a simple polygon (new article on Wikipedia): https://en.wikipedia.org/wiki/Convex_hull_of_a_simple_polygon

I've been working on cleaning up the main convex hull article (not yet finished) and added this one to fill in some details.

The problem has an interesting history: it's been known to be solvable in linear time since 1979, and many different algorithms for the same problem have been published before and since, but most of them are wrong.

This image by Adam Majewski from https://commons.wikimedia.org/wiki/File:Osculating_circles_of_the_Archimedean_spiral.svg shows the osculating circles of an Archimedean spiral. The spiral itself is not shown, but you can see it anyway, where the circles become dense.

It is not unusual that the circles nest. By the Tait–Kneser theorem (https://en.wikipedia.org/wiki/Tait%E2%80%93Kneser_theorem) this happens whenever the curvature along a curve is monotonic. And on most smooth curves, the curvature is monotonic except at a small number of points called vertices.

Hoffman's packing puzzle, and its connection to the inequality of arithmetic and geometric means: https://en.wikipedia.org/wiki/Hoffman%27s_packing_puzzle

The one I have is not quite so colorful as this Wikipedia image. My father-in-law made it for me some 30 years ago; you can see it in a corner of the photo at https://11011110.github.io/blog/2018/05/17/book-arrival.html

I don't unpack it very often, though, because I lost track of the handwritten table of solutions that I made when I first got it and it's quite difficult to re-pack.

Jessen's icosahedron (https://en.wikipedia.org/wiki/Jessen%27s_icosahedron): a non-convex shape with right dihedrals but not axis-aligned faces. It's rigid but not infinitesimally, so paper models are hard to make accurately.

I drew the new lead image after the article had for years shown the wrong shape (with vertices of a regular icosahedron). Surely someone else can do better?

Also it can be cut into pieces and reassembled into cubes. Anyone know an explicit construction?

Quasiperiodic bobbin lace patterns: https://arxiv.org/abs/1910.07935, Veronika Irvine, Therese Biedl, and Craig S. Kaplan, via https://twitter.com/bit_player/status/1185356703065354240 — aperiodic tilings in fiber arts.

The attached image is a photo of lace (not an illustration), braided into an Ammann–Beenker tiling pattern.

Kotzig's theorem (https://en.wikipedia.org/wiki/Kotzig%27s_theorem): Every convex polyhedron has an edge whose endpoints have total degree at most 13. (New article on Wikipedia.)

You might think that (because average vertex degree in a convex polyhedron is < 6) there will always be an edge whose endpoints have total degree at most 11, but it's not true. As Anton Kotzig proved in 1955, the answer is 13. A worst-case example is the triakis icosahedron, whose minimum-degree edges connect vertices of degrees 3 and 10.

My new dining room ceiling lamp is a trefoil knot! It's the "Vornado" LED lamp from WAC lighting (http://www.waclighting.com).

We chose it to replace a halogen lamp that shorted out, burned through its power cable, fell onto the table below it, and shattered hot glass all over the room, fortunately without causing a fire or seriously damaging the table and while the room was unoccupied.

Full photo set at https://www.ics.uci.edu/~eppstein/pix/trefoil/

- Home page
- https://www.ics.uci.edu/~eppstein/

I'm a computer scientist at the University of California, Irvine, interested in algorithms, data structures, discrete geometry, and graph theory.

Joined Apr 2017