Minimum enclosing ball.

Last update: May 5, 2022

miniball

Minimum enclosing ball.

Build Documentation Downloads Version Rust License

NOTE: This crate requires nightly Rust.

  • Finds circumscribed n-ball of set of bounds.
  • Finds minimum n-ball enclosing set of points.

Roadmap

  • Find minimum enclosing n-ball of n-balls.
  • Find minimum-volume enclosing n-ellipsoid.
  • Improve numerical stability and performance.

See the release history to keep track of the development.

License

Copyright © 2022 Rouven Spreckels [email protected]

Licensed under the terms of the MPL-2.0.

The MPL allows the integration of MPL-licensed code into proprietary codebases, as long as the MPL-licensed components remain accessible under the terms of the MPL.

Contribution

Unless you explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Covered Software by You shall be licensed as above, without any additional terms or conditions.

GitHub

https://github.com/qu1x/miniball
You might also like...
Untrusted IPC with maximum performance and minimum latency. On Rust, on Linux.

Untrusted IPC with maximum performance and minimum latency. On Rust, on Linux. When is this Rust crate useful? Performance or latency is crucial, and

May 25, 2022
Rust+Cargo lightweight hello world with the most minimum binary size possible.

Lightweight Cargo Hello World Rust+Cargo lightweight hello world with the most minimum binary size possible. requirements 1: Rustup (Rustc, Cargo) Ins

Dec 13, 2021
Maximum Relevance - Minimum redundancy feature selection algorithm

mrmr Maximum Relevance - Minimum redundancy feature selection algorithm implemented in Rust. Usage CLI app. It gets input from a csv dataset with head

Jan 1, 2022