Algorithms Different algorithmic problems and data structures implementations Sweep line algorithm for listing all crossings in a set of line segments - Bentley-Ottman agorithm Minimum enclosing circle - Welzl's O(n) algorithm with UI Treap data structure