Computational Geometry

Computational Geometry

• The Art Gallery Problem
• Closest Pair of Points (Divide and Conquer)

Segment Intersection

• Orientation of Three Points
• Line Segment Intersection (Existence)(CLRS)
• Any Pair of Segments Intersection (Sweep Line)

Triangulation

• Triangulation (Theory)
• Triangulation (Finding a Diagnoal)

Convex Hull

• Jarvis's March (Gift Wrapping)
• Graham's Scan