On the use of naturality in algorithmic resolution

This paper provides a simplified presentation of a known algorithm for resolution of singularities (in characteristic zero). It works in the context of marked ideals and uses naturality properties with respect to open restrictions and strong equivalence, to solve a delicate glueing problem that arises when induction on the dimension of the objects considered is applied.