We study the planar version of Minimum-Weight Set Cover, where one has to cover a given set of points with a minimum-weight subset of a given set of planar objects. For the unit-weight case, one PTAS (on disks) is known. For arbitrary weights however, the problem appears much harder, and in particular no PTASs are known. We present the first PTAS for Weighted Geometric Set Cover on planar objects, namely on axis-parallel unit squares. By extending the algorithm, we also obtain a PTAS for Minimum-Weight Dominating Set on intersection graphs of unit squares and Geometric Budgeted Maximum Coverage on unit squares. The running time of the developed algorithms is optimal under the exponential time hypothesis. We also show inapproximability results for Geometric Set Cover on various object shapes that are more general than unit squares.