Plane-filling trails for discontinuous traversals

On this page we see plane-filling trails visualizing the jumping Lebesgue/Z/Morton, U, Gray-code, Double-Gray-code, Inside-Out, Burstedde-Holke, and Hill-Z traversals. The Lebesgue curve is one of the classical plane-filling curves; the others have appeared in the computer science literature¹⁾. All of them have jumps, that is, they must be described as plane-filling curves that contain sections that do not cover any area, or they must be described as maps that are not continuous and not one-to-one. For this reason, we call these maps traversals rather than plane-filling curves.

Definition: (1,1,1,1)(0,-1,0,0)(1,1,1,1)(-2,0,0,0)(1,1,1,1)(0,-1,0,0)(1,1,1,1)

In this rendering, the squares that are filled are moved slightly apart to make space for drawing the jumps as horizontal corridors.

Definition: (1,0,1,1)(-1,1,0,0)(1,0,1,1)(1,0,1,1)(-1,-1,0,0)(1,0,1,1)

In this drawing, the diagonal jumps of the traversal are drawn as paths that follow a slight detour along the “mountain” side, from which they are suspended or cut out.

Definition: (1,0,1,1)(0,2,0,0)(-1,0,-1,-1)(2,0,0,0)(1,0,1,1)(0,-2,0,0)(-1,0,-1,-1)

The jumps of this traversal appear as bridges and tunnels.

Definition: (1,0,1,1)(0,2,0,0)(-1,0,-1,1)(2,0,0,0)(-1,0,1,1)(0,-2,0,0)(1,0,-1,1)

The jumps of this traversal appear as bridges and tunnels.

Definition: (-1,0,1,1)(0,2,0,0)(1,0,-1,1)(2,0,0,0)(1,0,1,1)(0,-2,0,0)(-1,0,-1,1)

The jumps of this traversal appear as bridges and tunnels.

Definition: (1,1,1,1)(-1,0,0,0)(1,1,1,1)(-1,-1,0,0)(1,1,-1,-1)(0,-1,0,0)(1,1,1,1)

The visualization shows the middle two of the four sections of the traversal.

Definition: (1,1,1,1)(-1,0,0,0)(1,1,1,1)(-1,-1,0,0)(1,1,1,-1)(0,-1,0,0)(1,1,1,1)

The visualization shows the middle two of the four sections of the traversal.