Computational geometry

Algorithms on points and segments in the plane: orientation and segment intersection, sweep-line intersection detection, convex hulls and closest pair; geometric search structures stay in Data structures.

• Closest pair of points problem
• Orientation and segment intersection tests
• Monotone chain convex hull algorithm
• Sweep-line segment intersection detection

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.