We present recent results on bounds for the number of realizations of minimally rigid graphs in plane and space. We consider complex solutions of the corresponding algebraic systems and give asymptotic bounds for the maximal number of realizations. Furthermore, we introduce a method for specifying edge lengths allowing many real solutions.