  Guided by consideration of problems in 2 and 3 dimensional lattice model
computation, we are led to define a number of new categories, and functors
between these categories and the partition category, culminating in the
introduction of two categories generalising the Temperley-Lieb category. We
show how to compute practically in these categories, by giving a combinatorial
realisation of their (topological) construction.
