Before revision:  We also ensure that each intermediate drawing lies in a 3D grid of polynomially-bounded volume. To the best of our knowledge, this is the first morphing algorithm that takes sublinear number of morphing steps while maintaining a polynomially-bounded grid size, and thus the resolution .
After revision:  We also ensure that each intermediate drawing lies in a 3D grid of polynomial volume .