123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158 |
- // Boost.Geometry Index
- // Additional tests
- // Copyright (c) 2011-2013 Adam Wulkiewicz, Lodz, Poland.
- // Use, modification and distribution is subject to the Boost Software License,
- // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
- // http://www.boost.org/LICENSE_1_0.txt)
- #include <iostream>
- #include <boost/geometry.hpp>
- #include <boost/geometry/index/rtree.hpp>
- #include <boost/chrono.hpp>
- #include <boost/foreach.hpp>
- #include <boost/random.hpp>
- int main()
- {
- namespace bg = boost::geometry;
- namespace bgi = bg::index;
- typedef boost::chrono::thread_clock clock_t;
- typedef boost::chrono::duration<float> dur_t;
- size_t values_count = 1000000;
- size_t queries_count = 100000;
- size_t nearest_queries_count = 10000;
- unsigned neighbours_count = 10;
- std::vector< std::pair<float, float> > coords;
- //randomize values
- {
- boost::mt19937 rng;
- //rng.seed(static_cast<unsigned int>(std::time(0)));
- float max_val = static_cast<float>(values_count / 2);
- boost::uniform_real<float> range(-max_val, max_val);
- boost::variate_generator<boost::mt19937&, boost::uniform_real<float> > rnd(rng, range);
- coords.reserve(values_count);
- std::cout << "randomizing data\n";
- for ( size_t i = 0 ; i < values_count ; ++i )
- {
- coords.push_back(std::make_pair(rnd(), rnd()));
- }
- std::cout << "randomized\n";
- }
- typedef bg::model::point<double, 2, bg::cs::cartesian> P;
- typedef bg::model::box<P> B;
- typedef bgi::rtree<B, bgi::linear<16, 4> > RT;
- //typedef bgi::rtree<B, bgi::quadratic<8, 3> > RT;
- //typedef bgi::rtree<B, bgi::rstar<8, 3> > RT;
- std::cout << "sizeof rtree: " << sizeof(RT) << std::endl;
- for (;;)
- {
- RT t;
- // inserting test
- {
- clock_t::time_point start = clock_t::now();
- for (size_t i = 0 ; i < values_count ; ++i )
- {
- float x = coords[i].first;
- float y = coords[i].second;
- B b(P(x - 0.5f, y - 0.5f), P(x + 0.5f, y + 0.5f));
- t.insert(b);
- }
- dur_t time = clock_t::now() - start;
- std::cout << time << " - insert " << values_count << '\n';
- }
- std::vector<B> result;
- result.reserve(100);
- B result_one;
- {
- clock_t::time_point start = clock_t::now();
- size_t temp = 0;
- for (size_t i = 0 ; i < queries_count ; ++i )
- {
- float x = coords[i].first;
- float y = coords[i].second;
- result.clear();
- t.query(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10))), std::back_inserter(result));
- temp += result.size();
- }
- dur_t time = clock_t::now() - start;
- std::cout << time << " - query(B) " << queries_count << " found " << temp << '\n';
- }
- {
- clock_t::time_point start = clock_t::now();
- size_t temp = 0;
- for (size_t i = 0 ; i < queries_count / 2 ; ++i )
- {
- float x1 = coords[i].first;
- float y1 = coords[i].second;
- float x2 = coords[i+1].first;
- float y2 = coords[i+1].second;
- float x3 = coords[i+2].first;
- float y3 = coords[i+2].second;
- result.clear();
- t.query(
- bgi::intersects(B(P(x1 - 10, y1 - 10), P(x1 + 10, y1 + 10)))
- &&
- !bgi::within(B(P(x2 - 10, y2 - 10), P(x2 + 10, y2 + 10)))
- &&
- !bgi::overlaps(B(P(x3 - 10, y3 - 10), P(x3 + 10, y3 + 10)))
- ,
- std::back_inserter(result)
- );
- temp += result.size();
- }
- dur_t time = clock_t::now() - start;
- std::cout << time << " - query(i && !w && !o) " << queries_count << " found " << temp << '\n';
- }
- result.clear();
- {
- clock_t::time_point start = clock_t::now();
- size_t temp = 0;
- for (size_t i = 0 ; i < nearest_queries_count ; ++i )
- {
- float x = coords[i].first + 100;
- float y = coords[i].second + 100;
- result.clear();
- temp += t.query(bgi::nearest(P(x, y), neighbours_count), std::back_inserter(result));
- }
- dur_t time = clock_t::now() - start;
- std::cout << time << " - query(nearest(P, " << neighbours_count << ")) " << nearest_queries_count << " found " << temp << '\n';
- }
- {
- clock_t::time_point start = clock_t::now();
- for (size_t i = 0 ; i < values_count / 10 ; ++i )
- {
- float x = coords[i].first;
- float y = coords[i].second;
- B b(P(x - 0.5f, y - 0.5f), P(x + 0.5f, y + 0.5f));
- t.remove(b);
- }
- dur_t time = clock_t::now() - start;
- std::cout << time << " - remove " << values_count / 10 << '\n';
- }
- std::cout << "------------------------------------------------\n";
- }
- return 0;
- }
|