test_nearest_test 30-Mar-2019 09:04:06 test_nearest_test: MATLAB version Test test_nearest which implements various nearest neighbor algorithms. M = 2, NR = 1000000, NS = 10 #1 time: 0.115, size = 10, i(1) = 367341 #2 time: 0.047, size = 10, i(1) = 367341 #3 time: 0.090, size = 10, i(1) = 367341 #4 time: 0.057, size = 10, i(1) = 367341 #5 skipped! #6 time: 1.654, size = 10, i(1) = 367341 #7 time: 0.176, size = 10, i(1) = 367341 M = 2, NR = 100000, NS = 100 #1 time: 0.072, size = 100, i(1) = 8599 #2 time: 0.018, size = 100, i(1) = 8599 #3 time: 0.037, size = 100, i(1) = 8599 #4 time: 0.017, size = 100, i(1) = 8599 #5 skipped! #6 time: 0.095, size = 100, i(1) = 8599 #7 time: 0.117, size = 100, i(1) = 8599 M = 2, NR = 10000, NS = 1000 #1 time: 0.056, size = 1000, i(1) = 7699 #2 time: 0.040, size = 1000, i(1) = 7699 #3 time: 0.078, size = 1000, i(1) = 7699 #4 time: 0.037, size = 1000, i(1) = 7699 #5 time: 0.375 (for Delaunay triangulation) #5 time: 0.016 (for Delaunay search) #5 time: 0.390, size = 1000, i(1) = 7699 #6 time: 0.022, size = 1000, i(1) = 7699 #7 time: 0.129, size = 1000, i(1) = 7699 M = 2, NR = 1000, NS = 10000 #1 time: 0.057, size = 10000, i(1) = 434 #2 time: 0.048, size = 10000, i(1) = 434 #3 time: 0.101, size = 10000, i(1) = 434 #4 time: 0.042, size = 10000, i(1) = 434 #5 time: 0.018 (for Delaunay triangulation) #5 time: 0.009 (for Delaunay search) #5 time: 0.027, size = 10000, i(1) = 434 #6 time: 0.007, size = 10000, i(1) = 434 #7 time: 0.025, size = 10000, i(1) = 434 M = 2, NR = 100, NS = 100000 #1 time: 0.063, size = 100000, i(1) = 60 #2 time: 0.205, size = 100000, i(1) = 60 #3 time: 0.212, size = 100000, i(1) = 60 #4 time: 0.210, size = 100000, i(1) = 60 #5 time: 0.014 (for Delaunay triangulation) #5 time: 0.067 (for Delaunay search) #5 time: 0.081, size = 100000, i(1) = 60 #6 time: 0.033, size = 100000, i(1) = 60 #7 time: 0.073, size = 100000, i(1) = 60 M = 2, NR = 10, NS = 1000000 #1 time: 0.090, size = 1000000, i(1) = 4 #2 time: 1.750, size = 1000000, i(1) = 4 #3 time: 1.444, size = 1000000, i(1) = 4 #4 time: 1.899, size = 1000000, i(1) = 4 #5 time: 0.000 (for Delaunay triangulation) #5 time: 0.520 (for Delaunay search) #5 time: 0.520, size = 1000000, i(1) = 4 #6 time: 0.048, size = 1000000, i(1) = 4 #7 time: 0.515, size = 1000000, i(1) = 4 M = 4, NR = 1000000, NS = 10 #1 time: 0.085, size = 10, i(1) = 196372 #2 time: 0.081, size = 10, i(1) = 196372 #3 time: 0.165, size = 10, i(1) = 196372 #4 time: 0.118, size = 10, i(1) = 196372 #5 skipped! #6 time: 1.880, size = 10, i(1) = 196372 #7 time: 0.270, size = 10, i(1) = 196372 M = 4, NR = 100000, NS = 100 #1 time: 0.085, size = 100, i(1) = 37064 #2 time: 0.028, size = 100, i(1) = 37064 #3 time: 0.082, size = 100, i(1) = 37064 #4 time: 0.053, size = 100, i(1) = 37064 #5 skipped! #6 time: 0.109, size = 100, i(1) = 37064 #7 time: 0.216, size = 100, i(1) = 37064 M = 4, NR = 10000, NS = 1000 #1 time: 0.085, size = 1000, i(1) = 7412 #2 time: 0.048, size = 1000, i(1) = 7412 #3 time: 0.087, size = 1000, i(1) = 7412 #4 time: 0.042, size = 1000, i(1) = 7412 #5 skipped! #6 time: 0.012, size = 1000, i(1) = 7412 #7 time: 0.210, size = 1000, i(1) = 7412 M = 4, NR = 1000, NS = 10000 #1 time: 0.091, size = 10000, i(1) = 653 #2 time: 0.061, size = 10000, i(1) = 653 #3 time: 0.135, size = 10000, i(1) = 653 #4 time: 0.058, size = 10000, i(1) = 653 #5 time: 0.194 (for Delaunay triangulation) #5 time: 0.030 (for Delaunay search) #5 time: 0.223, size = 10000, i(1) = 653 #6 time: 0.006, size = 10000, i(1) = 653 #7 time: 0.219, size = 10000, i(1) = 653 M = 4, NR = 100, NS = 100000 #1 time: 0.091, size = 100000, i(1) = 52 #2 time: 0.219, size = 100000, i(1) = 52 #3 time: 0.217, size = 100000, i(1) = 52 #4 time: 0.229, size = 100000, i(1) = 52 #5 time: 0.013 (for Delaunay triangulation) #5 time: 0.122 (for Delaunay search) #5 time: 0.135, size = 100000, i(1) = 52 #6 time: 0.019, size = 100000, i(1) = 52 #7 time: 0.136, size = 100000, i(1) = 52 M = 4, NR = 10, NS = 1000000 #1 time: 0.112, size = 1000000, i(1) = 5 #2 time: 1.769, size = 1000000, i(1) = 5 #3 time: 1.456, size = 1000000, i(1) = 5 #4 time: 1.967, size = 1000000, i(1) = 5 #5 time: 0.001 (for Delaunay triangulation) #5 time: 0.684 (for Delaunay search) #5 time: 0.686, size = 1000000, i(1) = 5 #6 time: 0.053, size = 1000000, i(1) = 5 #7 time: 0.689, size = 1000000, i(1) = 5 M = 8, NR = 1000000, NS = 10 #1 time: 0.143, size = 10, i(1) = 80092 #2 time: 0.149, size = 10, i(1) = 80092 #3 time: 0.315, size = 10, i(1) = 80092 #4 time: 0.228, size = 10, i(1) = 80092 #5 skipped! #6 time: 2.993, size = 10, i(1) = 80092 #7 time: 0.742, size = 10, i(1) = 80092 M = 8, NR = 100000, NS = 100 #1 time: 0.152, size = 100, i(1) = 80002 #2 time: 0.095, size = 100, i(1) = 80002 #3 time: 0.197, size = 100, i(1) = 80002 #4 time: 0.137, size = 100, i(1) = 80002 #5 skipped! #6 time: 0.171, size = 100, i(1) = 80002 #7 time: 0.629, size = 100, i(1) = 80002 M = 8, NR = 10000, NS = 1000 #1 time: 0.145, size = 1000, i(1) = 1272 #2 time: 0.056, size = 1000, i(1) = 1272 #3 time: 0.126, size = 1000, i(1) = 1272 #4 time: 0.054, size = 1000, i(1) = 1272 #5 skipped! #6 time: 0.017, size = 1000, i(1) = 1272 #7 time: 0.290, size = 1000, i(1) = 1272 M = 8, NR = 1000, NS = 10000 #1 time: 0.146, size = 10000, i(1) = 357 #2 time: 0.106, size = 10000, i(1) = 357 #3 time: 0.218, size = 10000, i(1) = 357 #4 time: 0.088, size = 10000, i(1) = 357 #5 skipped! #6 time: 0.020, size = 10000, i(1) = 357 #7 time: 0.527, size = 10000, i(1) = 357 M = 8, NR = 100, NS = 100000 #1 time: 0.163, size = 100000, i(1) = 6 #2 time: 0.265, size = 100000, i(1) = 6 #3 time: 0.264, size = 100000, i(1) = 6 #4 time: 0.276, size = 100000, i(1) = 6 #5 time: 3.602 (for Delaunay triangulation) #5 time: 0.478 (for Delaunay search) #5 time: 4.080, size = 100000, i(1) = 6 #6 time: 0.037, size = 100000, i(1) = 6 #7 time: 1.983, size = 100000, i(1) = 6 M = 8, NR = 10, NS = 1000000 #1 time: 0.173, size = 1000000, i(1) = 7 #2 time: 1.783, size = 1000000, i(1) = 7 #3 time: 1.500, size = 1000000, i(1) = 7 #4 time: 2.076, size = 1000000, i(1) = 7 #5 time: 0.001 (for Delaunay triangulation) #5 time: 0.811 (for Delaunay search) #5 time: 0.812, size = 1000000, i(1) = 7 #6 time: 0.087, size = 1000000, i(1) = 7 #7 time: 11.309, size = 1000000, i(1) = 7 test_nearest_test Normal end of execution. 30-Mar-2019 09:05:02 diary off