  We describe algorithms to compute fixed fields, splitting fields and towers
of radical extensions without using polynomial factorisation in towers or
constructing any field containing the splitting field, instead extending Galois
group computations for this task. We also describe the computation of geometric
Galois groups (monodromy groups) and their use in computing absolute
factorizations.
