Design and analysis of algorithms and data structures for geometric problems. The particular groups of problems addressed include convex hull construction, proximity, Voronoi Diagrams, geometric search, intersection.