mirror of
https://github.com/boostorg/geometry.git
synced 2026-02-28 05:22:22 +00:00
7b1e4bd601
Add a tip about usage of Boost.Range adaptors with the rtree. Add an example of usage of Boost.Range adaptors. Replace invalid main(void) with main() in examples. Fix MSVC type conversion warnings in examples.
66 lines
1.5 KiB
C++
66 lines
1.5 KiB
C++
// Boost.Geometry Index
|
|
//
|
|
// Quickbook Examples
|
|
//
|
|
// Copyright (c) 2011-2014 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)
|
|
|
|
//[rtree_iterative_query
|
|
|
|
#include <boost/geometry.hpp>
|
|
#include <boost/geometry/geometries/point.hpp>
|
|
#include <boost/geometry/geometries/box.hpp>
|
|
|
|
#include <boost/geometry/index/rtree.hpp>
|
|
|
|
// just for output
|
|
#include <iostream>
|
|
|
|
namespace bg = boost::geometry;
|
|
namespace bgi = boost::geometry::index;
|
|
|
|
int main()
|
|
{
|
|
typedef bg::model::point<double, 2, bg::cs::cartesian> point;
|
|
typedef point value;
|
|
typedef bgi::rtree< value, bgi::linear<16> > rtree_t;
|
|
|
|
// create the rtree using default constructor
|
|
rtree_t rtree;
|
|
|
|
// create some values
|
|
for ( double f = 0 ; f < 10 ; f += 1 )
|
|
{
|
|
// insert new value
|
|
rtree.insert(point(f, f));
|
|
}
|
|
|
|
// query point
|
|
point pt(5.1, 5.1);
|
|
|
|
// iterate over nearest Values
|
|
for ( rtree_t::const_query_iterator
|
|
it = rtree.qbegin(bgi::nearest(pt, 100)) ;
|
|
it != rtree.qend() ;
|
|
++it )
|
|
{
|
|
double d = bg::distance(pt, *it);
|
|
|
|
std::cout << bg::wkt(*it) << ", distance= " << d << std::endl;
|
|
|
|
// break if the distance is too big
|
|
if ( d > 2 )
|
|
{
|
|
std::cout << "break!" << std::endl;
|
|
break;
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
//]
|