  We give a new approach to handling hypergraph regularity. This approach
allows for vertex-by-vertex embedding into regular partitions of hypergraphs,
and generalises to regular partitions of sparse hypergraphs. We also prove a
corresponding sparse hypergraph regularity lemma.
