The thesis studies algorithms for some problems in computational geometry using prune and search technique. By using prune and search technique, I solved the intersection radius problems in the plane for sets of line segments, rays, wedges, half planes and convex polygons. I also computet a centerpoint of a planar set of points. Then there is a presentation of a generalised technique of prune and search which however does not yield any new results.