A Minimal Circle Problem visualizer using the nannou toolkit.
-
Updated
Jun 5, 2023 - Rust
A Minimal Circle Problem visualizer using the nannou toolkit.
Sorbonne Université MU4IN500
Naive and Welzl algorithm for computing the smallest enclosing circle
Robust implementations of convex hull, plane sweep intersection, and minimum enclosing circle with benchmarking and real-world geospatial application.
Add a description, image, and links to the welzl topic page so that developers can more easily learn about it.
To associate your repository with the welzl topic, visit your repo's landing page and select "manage topics."