boost/geometry
2
0
Fork 0
mirror of https://github.com/boostorg/geometry.git synced 2026-02-12 12:12:10 +00:00
Code Issues Projects Releases Wiki Activity

Implemented all variants of rtree::query() method. spatial and nearest returning 1 and k values.

Browse Source 
[SVN r82600]
This commit is contained in:
Adam Wulkiewicz
2013-01-24 22:24:58 +00:00
parent 455b2d9f45
commit dfb33baede
10 changed files with 643 additions and 31 deletions
Download Patch File Download Diff File Expand all files Collapse all files

107
tests/additional_speed.cpp
View File

@@ -58,8 +58,8 @@ int main()
// typedef bgi::rtree<B, bgi::runtime::quadratic > RT;
//typedef bgi::rtree<B, bgi::rstar<32, 8> > RT;
//typedef bgi::rtree<B, bgi::runtime::rstar > RT;
for ( ;; )
for (unsigned i = 0 ; i < 10 ; ++i)
{
RT t;
//RT t(bgi::runtime::linear(32, 8));
@@ -126,6 +126,60 @@ int main()
std::cout << time << "s - spatial_query(i, !w, !o) " << queries_count << " found " << temp << '\n';
}
{
tim.restart();
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.spatial_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();
}
double time = tim.elapsed();
std::cout << time << "s - spatial_query(i && !w && !o) " << queries_count << " found " << temp << '\n';
}
{
tim.restart();
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();
}
double time = tim.elapsed();
std::cout << time << "s - query(i && !w && !o) " << queries_count << " found " << temp << '\n';
}
result.clear();
{
@@ -177,6 +231,55 @@ int main()
std::cout << time << "s - nearest_query(bounded(n, c, f), 5) " << (queries_count / 10) << " found " << temp << '\n';
}
{
tim.restart();
size_t temp = 0;
for (size_t i = 0 ; i < queries_count / 10 ; ++i )
{
float x = coords[i].first + 100;
float y = coords[i].second + 100;
temp += t.query(bgi::nearest(P(x, y)), result_one);
}
double time = tim.elapsed();
std::cout << time << "s - query(nearest(P)) " << (queries_count / 10) << " found " << temp << '\n';
}
{
tim.restart();
size_t temp = 0;
for (size_t i = 0 ; i < queries_count / 10 ; ++i )
{
float x = coords[i].first + 100;
float y = coords[i].second + 100;
result.clear();
temp += t.query(bgi::nearest(P(x, y), 5), std::back_inserter(result));
}
double time = tim.elapsed();
std::cout << time << "s - query(nearest(P, 5)) " << (queries_count / 10) << " found " << temp << '\n';
}
{
tim.restart();
size_t temp = 0;
for (size_t i = 0 ; i < queries_count / 10 ; ++i )
{
float x = coords[i].first + 100;
float y = coords[i].second + 100;
result.clear();
temp += t.query(bgi::nearest(
bgi::bounded(
bgi::to_nearest(P(x, y)),
bgi::to_centroid(0),
bgi::to_furthest(100000)
),
5),
std::back_inserter(result)
);
}
double time = tim.elapsed();
std::cout << time << "s - query(nearest(bounded(n, c, f), 5)) " << (queries_count / 10) << " found " << temp << '\n';
}
{
tim.restart();
for (size_t i = 0 ; i < values_count / 10 ; ++i )