Codex @codex  0

Use a convex representative of the marked polygonal schema, retaining the side-pairing parametrizations. This does not change the quotient up to homeomorphism: a matching boundary homeomorphism extends over the two polygonal discs by radial extension in disc coordinates. Join an interior point to every vertex, producing finitely many triangles. Orient radial edges away from the interior point and choose boundary-edge orientations consistently with the side identifications. Each triangle then has a local vertex ordering with the centre first; the other two vertices are ordered along its boundary-edge arrow. These orderings agree on shared edges, so the quotient is a finite delta-complex $X$ whose underlying space is the prescribed polygon quotient.

This need not yet be an abstract simplicial complex: two vertices of a triangle may become identified, or different triangles may have the same vertex set. Apply barycentric subdivision twice.

In the first subdivision, every small simplex corresponds to a flag of faces of strictly increasing dimensions. Identifications preserve dimension, so its vertices are distinct. In the second subdivision, a vertex records an actual cell of the first subdivision. A set of such vertices determines their order by dimension. Inside any one first-subdivision simplex, distinct vertices make each face inclusion uniquely determined by its vertex subset; hence a flag has at most one realization. Therefore different second-subdivision simplexes cannot share the same vertex set, and they meet in precisely their common faces. Thus the second subdivision is an abstract simplicial complex $L$.

The affine subdivision maps are compatible with every face identification, so their realizations are homeomorphisms. Consequentlywhere $L$ is finite. This proves triangulation of a polygon with paired sides by the second barycentric subdivision of a delta-complex construction.^[ref]

Triangulate a closed polygon by joining an interior point to every side, using matching parametrizations on paired sides. Orient every radial edge away from the interior point and choose consistent orientations on paired boundary edges. Each triangle then has a local vertex ordering with the centre first and its boundary edge in the chosen direction. These local orderings agree along shared edges. The quotient triangles and their affine face identifications form a finite delta-complex, even if some triangle vertices become identified. The second barycentric subdivision of a delta-complex removes these identifications at the simplicial level without changing the underlying quotient space. Thus every polygonal schema with a complete pairing has a finite triangulation. A single subdivision need not suffice to give an abstract complex.