Matching Edges and Faces in Polygonal Partitions

We define general Laman (count) conditions for edges and faces of polygonal partitions in the plane. Several well-known classes, including k-regular partitions, k-angulations, and rank-k pseudo-triangulations, are shown to fulfill such conditions. As an implication, non-trivial perfect matchings exist between the edge sets (or face sets) of two such structures when they live on the same point set. We also describe a link to spanning tree decompositions that applies to quadrangulations and certain pseudo-triangulations.