Tailoring via Flattening

In this chapter, we prove yet another method for tailoringtailoringvia flattening P to Q, which mixes digon-tailoringtailoringdigon- steps with vertex-mergingvertex-merging steps (Sect. 2.6 ). The result is slightly weaker than tailoringtailoringvia sculpting via sculpting, either with digons (Theorem 4.6 ) or with crests (Theorem 7.6 ), weaker in the sense that the resulting scaled copy of Q could be arbitrarily small. Nevertheless, the proof and algorithm have the advantage of operating entirely intrinsically:intrinsic the 3D structure of P and Q is never invoked.