In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our proposal is motivated by the need of describing specific operations to be done on topological representations of ob jects in computer graphics, especially for simulation of complex structured systems where rearrangements of compartments are sub ject to change. We also define application of such meta-rules and prove that it preserves some necessary conditions for G-maps.