We present a new approach to problems in geometric optimization that are traditionally solved using the parametric searching technique of Megiddo. Our new approach is based on expander graphs and is conceptually much simpler and has more explicit geometric flavor. It does not require parallelization or randomization, and it exploits recent range-searching techniques of Matousek and others. We exemplify the technique on three problems, the slope selection problem, the planar distance selection problem, and the planar two-center problem. For the first problem we develop an O(n log3 n) solution, which, although suboptimal, is very simple. The second and third problems are more typical examples of our approach. Our solutions have, respectively, running time O(n4/3 log3+δ n), for any δ > 0, and O(n2 log3 n), comparable with the respective solutions of [2, 5].