This work regards the order polytopes arising from the class of generalized
snake posets and their posets of meet-irreducible elements. Among generalized
snake posets of the same rank, we characterize those whose order polytopes have
minimal and maximal volume. We give a combinatorial characterization of the
circuits in these order polytopes and then conclude that every regular
triangulation is unimodular. For a generalized snake word, we count the number
of flips for the canonical triangulation of these order polytopes. We determine
that the flip graph of the order polytope of the poset whose lattice of filters
comes from a ladder is the Cayley graph of a symmetric group. Lastly, we
introduce an operation on triangulations called twists and prove that twists
preserve regular triangulations.Comment: 39 pages, 26 figures, comments welcomed