This thesis aims at developing algorithms for the computation of restricted Voronoi diagrams using nearest neighbor queries. A structure able to answer nearest neighbor queries essentially encodes a Voronoi diagram, but not the details of its combinatorics. Our goal is therefore to compute the combinatorics of the Voronoi diagram from nearest neighbor queries. This thesis is especially focused on restricted Voronoi diagrams, for which only a portion of the diagram is to be computed in a subset of the ambient space.