Lattice Labyrinth Tessellations

Year: 2014 Authors: David Mitchell

Core claim

A missing-links algorithm constructs infinitely many lattice labyrinth families on square and triangular lattices, governed by simple Diophantine conditions and symmetry constraints.

Topics

tessellation families, lattice graphs, symmetry, Diophantine conditions, missing-links algorithm

Domains

graph theory, tiling theory, number theory, Diophantine equations, Hamiltonian cycles, pattern design, logo design, Escher-style tessellations

Methods

constructive algorithm, parameter classification, lattice-link analysis, family enumeration, symmetry analysis

Media

square lattice, triangular lattice, polyominoes, polyiamonds, figures and tables

Source status

This page publishes metadata and extracted analytical signals only. Raw PDF and full OCR text are kept local for now.