Many of the important problems in geometric data structures are range searching problems and decades of research in this fundamental area of computational geometry has generated many beautiful results. Despite its age, this area is still alive and research is still ongoing. In this talk, after a brief introduction, we review some of the fundamental theorems in range searching and show how they can be used to obtain elegant solutions to some range searching problems. We will see how simple ideas can be used to solve old open problems by reviewing a few recent results. While we try to cover many of the popular techniques in range searching, more focus is put on intuition rather than technical details. Finally, we will conclude with a handful of interesting open problems.