We introduce a new concept of constructing a generalized Voronoi inverse (GVI) of a given tessellation T of the plane. Our objective is to place a set Si of one or more sites in each convex region (cell) ti ∈ T , such that all the edges of T coincide with the edges of Voronoi diagram V (S), where S = i Si, and ∀i, j, i = j, Si Sj = ∅. In this paper, we study the properties of GVI for the special case when T is a rectangular tessellation and propose an algorithm that finds a minimal set of sites S. We also show that for a general tessellation, a solution of GVI always exists.