Smallest Enclosing Balls of Points - Fast and Robust in C++.

(high-quality software for smallest enclosing balls of balls is available in the computational geometry algorithms library CGAL)

This is the miniball software (V3.0) for computing smallest enclosing balls of points in arbitrary dimensions. It consists of a C++ header file Miniball.hpp (around 500 lines of code) and two example programs miniball_example.cpp and miniball_example_containers.cpp that demonstrate the usage. The first example stores the coordinates of the input points in a two-dimensional array, the second example uses a list of vectors to show how generic containers can be used. Credits: Aditya Gupta and Alexandros Konstantinakis-Karmis have significantly contributed to this version of the software. The miniball software is available under the GNU General Public License (GPLv3). If your intended use is not compliant with this license, please buy a commercial license (EUR 500). You need a license if the software that you develop using Miniball V3.0 is not open source. Changes from previous versions. The theory behind the miniball software (Proc. 7th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science 1643, Springer-Verlag, pp.325-338, 1999).

Main Features:

• Very fast in low dimensions.

• High numerical stability. Almost all input degeneracies (cospherical points, multiple points, points very close together) are routinely handled.

• Easily integrates into your code. You can freely choose the coordinate type of your points and the container to store the points. If you still need to adapt the code, the header is small and readable and contains documentation for all major methods.