miniball
miniball copied to clipboard
hbf
Fast computation of the smallest enclosing ball of a point set, in low or moderately high dimensions.
I ran the algorithm in both java and cpp on the following pointset: 100000000000000 010000000000000 001000000000000 000100000000000 000010000000000 000001000000000 000000100000000 000000010000000 000000001000000 000000000100000 000000000010000 000000000001000 000000000000100 000000000000010 000000000000001 and got...
For data set: 150, 650; 150, 700; 200, 600; 200, 650; 250, 600; 250, 650; 100, 700; I get: 90.1388 which look OK but if I add 250, 700; I...
When compiling a project which includes "Seb.h" using MSVC, compilation will fail due to the missing POSIX headers: ``` cpp\main/Seb_debug.h(12,10): fatal error : 'sys/resource.h' file not found ``` I was...
It would be nice to add approximate calculation complexity into README file. Something like O(N * D * log(D)). Where N is number of points and D is dimension. (I...
Hi, I found a small set of points in real world data that causes miniball to enter into an infinite loop. I was going to patch the problem before submitting...
The calculation for the data at http://www.frank-buss.de/tmp/test.data doesn't terminate. To reproduce the bug: PointSet pts = PointSetUtils.pointsFromStream(new FileInputStream("c:\tmp\test-bug.data")); new Miniball(pts); Tested with Java version 1.7.0_71, 64 bit on Windows 7....
Currently, the benchmark on the project front page uses points coming from a sphere, which is a hard case for the algorithm. The performance on "normal" point sets is much...
Write a simple test suite that checks the basic behaviour. The code to generate (some) "critical" point set configurations is already there (see `test` directory) and there are a few...
Port the code to Java. Vote on this issue if you are interested in a Java implementation of the algorithm.