By a theorem of Agol and Guéritaud, every transitive pseudo-Anosov flow on a closed oriented 3-manifold can be combinatorially encoded by a finite veering triangulation. This encoding is not unique: different veering triangulations arise by drilling out different collections of periodic orbits of the flow. In this talk, I will describe an algorithm that, given one veering triangulation, constructs another that encodes the same flow. I will also discuss the dynamical motivations for studying this operation and why understanding the resulting change in the combinatorics matters. This is joint work with Henry Segerman.