Function main

demo/main.cpp:142–212

}

int main(int argc, char* argv[])
{
	Real min_x = std::numeric_limits<Real>::max();
	Real max_x = std::numeric_limits<Real>::min();
	positions.reserve(N * N * N);
	for (unsigned int i = 0; i < N; ++i)
	{
		for (unsigned int j = 0; j < N; ++j)
		{
			for (unsigned int k = 0; k < N; ++k)
			{
				std::array<Real, 3> x = {{
						r_omega * (2.0 * static_cast<Real>(i) / static_cast<Real>(N-1)-1.0),
						r_omega * (2.0 * static_cast<Real>(j) / static_cast<Real>(N-1)-1.0),
						r_omega * (2.0 * static_cast<Real>(k) / static_cast<Real>(N-1)-1.0)}};

				Real l2  = x[0] * x[0] + x[1] * x[1] + x[2] * x[2];
				if (l2 < r_omega2)
				{
					x[0] += 0.35;
					x[1] += 0.35;
					x[2] += 0.35;
					positions.push_back(x);
					if (min_x > x[0])
					{
						min_x = x[0];
					}
					if (max_x < x[0])
					{
						max_x = x[0];
					}
				}
			}
		}
	}
	std::random_shuffle(positions.begin(), positions.end());

	NeighborhoodSearch nsearch(radius, true);
	nsearch.add_point_set(positions.front().data(), positions.size(), true, true);
	nsearch.find_neighbors();

	std::cout << "#Points                                = " << positions.size() << std::endl;
	std::cout << "Search radius                          = " << radius << std::endl;
	std::cout << "Min x                                  = " << min_x << std::endl;
	std::cout << "Max x                                  = " << max_x << std::endl;
	std::cout << "Average number of neighbors            = " << compute_average_number_of_neighbors(nsearch) << std::endl;
	std::cout << "Average index distance prior to z-sort = " << compute_average_distance(nsearch) << std::endl;

	nsearch.z_sort();
	for (auto const& d : nsearch.point_sets())
	{
		d.sort_field(positions.data());
	}
	nsearch.find_neighbors();
	//compare_with_bruteforce_search(nsearch);

	std::cout << "Average index distance after z-sort    = " << compute_average_distance(nsearch) << std::endl;