Implementation of an O(n log n) algorithm for the Smallest Enclosing Circle and the Voronoi Diagram, using efficient structures (Red‑Black tree, HashMap) with a JavaFX GUI.
-
Updated
May 30, 2025 - Java
Implementation of an O(n log n) algorithm for the Smallest Enclosing Circle and the Voronoi Diagram, using efficient structures (Red‑Black tree, HashMap) with a JavaFX GUI.
Naive and Welzl algorithm for computing the smallest enclosing circle
Add a description, image, and links to the smallest-enclosing-circle topic page so that developers can more easily learn about it.
To associate your repository with the smallest-enclosing-circle topic, visit your repo's landing page and select "manage topics."