Multiplicative Weights Algorithm for 2D-Smallest-Circle Problem

Problem Statement

Compute the smallest circle that contains all points of a given set in the 2D Euclidean plane.

---

Controls

• R – Reset the point generation and circle
• T – Advance the algorithm

---

Pseudocode

Adapted from the lecture script:

• ETH Zürich: A&W Skript – Lecture Notes by Angelika Steger and Emo Welzl, Page 201.