An implementation of Welzl's algorithm for calculating the smallest enclosing circle of a set of points
-
Updated
Jul 21, 2022 - JavaScript
An implementation of Welzl's algorithm for calculating the smallest enclosing circle of a set of points
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.
A Minimal Circle Problem visualizer using the nannou toolkit.
Naive and Welzl algorithm for computing the smallest enclosing circle
This repository contains a project made for "Algorytmy geometryczne" (geometric algorithms) course is took at AHG University of Krakow
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."