Implement computational geometry algorithms

Create implementations for fundamental computational geometry algorithms:

## Basic algorithms:
- Convex hull (Graham scan, Jarvis march)
- Line intersection
- Point in polygon
- Closest pair of points
- Smallest enclosing circle
- Area of polygon
- Orientation test

## Advanced algorithms:
- Voronoi diagram
- Delaunay triangulation
- Segment intersection
- Sweep line algorithms
- Rectangle intersection
- Polygon clipping
- Point location

## Requirements:
- Include visualization helpers
- Create test cases with geometric interpretations
- Document time and space complexity
- Provide practical applications

This collection will cover essential geometric algorithms used in computer graphics, robotics, and geographic information systems.