1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
|
OBSOLETE
// Boost.Geometry (aka GGL, Generic Geometry Library)
//
// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
// 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)
//
// Doxygen Examples, for main page
#include <boost/tuple/tuple.hpp>
#if defined(_MSC_VER)
// We deliberately mix float/double's here so turn off warning
//#pragma warning( disable : 4244 )
#endif // defined(_MSC_VER)
#include <boost/geometry/geometry.hpp>
#include <boost/geometry/algorithms/overlaps.hpp>
#include <boost/geometry/geometries/geometries.hpp>
#include <boost/geometry/geometries/point_xy.hpp>
#include <boost/geometry/geometries/register/point.hpp>
// Small QRect simulations following http://doc.trolltech.com/4.4/qrect.html
// Todo: once work the traits out further, would be nice if there is a real example of this.
// However for the example it makes no difference, it will work any way.
struct QPoint
{
int x, y;
// In Qt these are methods but for example below it makes no difference
};
struct QRect
{
int x, y, width, height;
QRect(int _x, int _y, int w, int h)
: x(_x), y(_y), width(w), height(h)
{}
// In Qt these are methods but that will work as well, requires changing traits below
};
// Would be get/set with x(),y(),setX(),setY()
BOOST_GEOMETRY_REGISTER_POINT_2D(QPoint, int, cs::cartesian, x, y)
// Register the QT rectangle. The macro(s) does not offer (yet) enough flexibility to do this in one line,
// but the traits classes do their job perfectly.
namespace boost { namespace geometry { namespace traits
{
template <> struct tag<QRect> { typedef box_tag type; };
template <> struct point_type<QRect> { typedef QPoint type; };
template <size_t C, size_t D>
struct indexed_access<QRect, C, D>
{
static inline int get(const QRect& qr)
{
// Would be: x(), y(), width(), height()
return C == min_corner && D == 0 ? qr.x
: C == min_corner && D == 1 ? qr.y
: C == max_corner && D == 0 ? qr.x + qr.width
: C == max_corner && D == 1 ? qr.y + qr.height
: 0;
}
static inline void set(QRect& qr, const int& value)
{
// Would be: setX, setY, setWidth, setHeight
if (C == min_corner && D == 0) qr.x = value;
else if (C == min_corner && D == 1) qr.y = value;
else if (C == max_corner && D == 0) qr.width = value - qr.x;
else if (C == max_corner && D == 1) qr.height = value - qr.y;
}
};
}}}
void example_for_main_page()
{
using namespace boost::geometry;
int a[2] = {1,1};
int b[2] = {2,3};
double d = distance(a, b);
std::cout << "Distance a-b is:" << d << std::endl;
ring_2d poly;
double points[][2] = {{2.0, 1.3}, {4.1, 3.0}, {5.3, 2.6}, {2.9, 0.7}, {2.0, 1.3}};
append(poly, points);
boost::tuple<double, double> p = boost::make_tuple(3.7, 2.0);
std::cout << "Point p is in polygon? " << (within(p, poly) ? "YES" : "NO") << std::endl;
std::cout << "Area: " << area(poly) << std::endl;
double d2 = distance(a, p);
std::cout << "Distance a-p is:" << d2 << std::endl;
/***
Now extension
point_ll_deg amsterdam, paris;
parse(amsterdam, "52 22 23 N", "4 53 32 E");
parse(paris, "48 52 0 N", "2 19 59 E");
std::cout << "Distance A'dam-Paris: " << distance(amsterdam, paris) / 1000.0 << " kilometers " << std::endl;
***/
QRect r1(100, 200, 15, 15);
QRect r2(110, 210, 20, 20);
if (overlaps(r1, r2))
{
assign(r2, 200, 300, 220, 320);
}
}
void example_for_transform()
{
using namespace boost::geometry;
typedef point<double, 3, cs::cartesian> XYZ;
typedef point<double, 3, cs::spherical<degree> > SPH;
XYZ p;
SPH sph1, sph2;
assign(sph1, 12.5, 41.90, 1.0);
// Go from spherical to Cartesian-3D:
transform(sph1, p);
// Go back from Cartesian 3D to spherical:
transform(p, sph2);
std::cout << dsv(p) << " <-> " << dsv(sph2) << std::endl;
typedef point_xy<double> XY;
typedef point_xy<int> PIXEL;
XY xy(50, 50);
strategy::transform::map_transformer<XY, PIXEL, false> map(0, 0, 100, 100, 1024, 768);
PIXEL pix;
transform(xy, pix, map);
std::cout << pix.x() << "," << pix.y() << std::endl;
}
int main(void)
{
example_for_main_page();
example_for_transform();
return 0;
}
|
