Problems in computational geometry, worst case complexity of geometric algorithms; expected complexity of geometric algorithms and geometric probability, geometric intersection problems, nearest neighbor searching, point inclusion problems, distance between sets, polygon decomposition, the Voronoi diagram and other planner graph, updating and deleting from geometric structures.