Steven Skiena’s Computational Geometry Algorithms: Graham Scan, Jarvis March & More
Steven Techniques refer to algorithms by Steven S. Skiena (Stony Brook University) for computational geometry and combinatorics—prized for simplicity and efficiency.
Key Algorithms
- Graham Scan: Convex hull in O(n log n); starts at leftmost point, adds points counter‑clockwise.
- Jarvis March (Gift Wrapping): Convex hull in O(nh) where h = hull vertices; iteratively selects the most counter‑clockwise point.
- Gift Wrapping (variant): Another O(n log n) hull algorithm with a different inclusion test.
- Sweep Line Algorithm: Finds shortest paths in planar graphs in O(E log V); vertical line sweeps left‑to‑right updating distances.
Applications
Used in computer graphics (collision detection, rendering), robotics (path planning), computational biology (protein folding), and GIS (map overlay). Their clarity makes them teaching staples.