4 search results - page 1 / 1 » Sampling Eulerian orientations of triangular lattice graphs |
CORR
2007
Springer
13 years 10 months ago
2007
Springer
COMBINATORICS
2004
13 years 10 months ago
2004
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
COMBINATORICS
2000
13 years 10 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
TVCG
2008
13 years 10 months ago
2008
In this paper we present an algorithm that operates on a triangular mesh and classifies each face of a triangle as either inside or outside. We present three example applications o...