Multigrid techniques have been used successfully in practice to speed the convergence of computationally intensive, PDE iterative solution schemes. Instead of iterating to termination accuracy on a fine grid, multigrid algorithms move computation among a hierarchy of grids. Adapting structured multigrid techniques to unstructured mesh hierarchies requires a substantial increase in preprocessing tasks such as mesh generation, discretization, and the construction of inter-mesh transfer operators. In addition, the current generation of medium-grained parallel supercomputers requires a set of good domain partitions for efficient parallel execution. We present three practical strategies to efficiently accomplish these preprocessing tasks. These strategies were designed to address large problem sizes by using fast, simple heuristics. We present analytical and experimental work demonstrating the viability of these strategies. Issues and directions are presented for future work toward the goal of efficiently implementing 3D unstructured multigrid algorithms on the current generation of supercomputers.