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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
// SPDX-FileCopyrightText: 2020 - 2025 Kohei Yoshida
//
// SPDX-License-Identifier: MIT
#include <mdds/rtree.hpp>
#include <iostream>
#include <fstream>
//!code-start: tree-type
// Make the node capacity intentionally small.
struct tiny_traits_2d
{
constexpr static size_t dimensions = 2;
constexpr static size_t min_node_size = 2;
constexpr static size_t max_node_size = 5;
constexpr static size_t max_tree_depth = 100;
constexpr static bool enable_forced_reinsertion = true;
constexpr static size_t reinsertion_size = 2;
};
using rt_type = mdds::rtree<int, int, tiny_traits_2d>;
//!code-end: tree-type
//!code-start: input-data
// 2D rectangle with the top-left position (x, y), width and height.
struct rect
{
int x;
int y;
int w;
int h;
};
std::vector<rect> rects =
{
{ 3538, 9126, 1908, 1908 },
{ 34272, 52053, 2416, 2543 },
{ 32113, 9761, 2416, 638 },
{ 16493, 16747, 7369, 2289 },
{ 29192, 23732, 3432, 2035 },
{ 35797, 17000, 1781, 892 },
{ 15857, 29319, 2162, 1654 },
{ 5825, 24239, 3559, 8512 },
{ 9127, 46846, 2543, 1019 },
{ 7094, 54338, 5210, 892 },
{ 18779, 39734, 3813, 10417 },
{ 32749, 35923, 2289, 2924 },
{ 26018, 31098, 257, 2797 },
{ 6713, 37066, 2924, 1146 },
{ 19541, 3157, 3305, 1146 },
{ 21953, 10904, 4448, 892 },
{ 15984, 24240, 5210, 1273 },
{ 8237, 15350, 2670, 2797 },
{ 17001, 13826, 4067, 1273 },
{ 30970, 13826, 3940, 765 },
{ 9634, 6587, 1654, 1781 },
{ 38464, 47099, 511, 1400 },
{ 20556, 54085, 1400, 1527 },
{ 37575, 24113, 1019, 765 },
{ 20429, 21064, 1146, 1400 },
{ 31733, 4427, 2543, 638 },
{ 2142, 27161, 1273, 7369 },
{ 3920, 43289, 8131, 1146 },
{ 14714, 34272, 1400, 4956 },
{ 38464, 41258, 1273, 1273 },
{ 35542, 45703, 892, 1273 },
{ 25891, 50783, 1273, 5083 },
{ 35415, 28431, 2924, 1781 },
{ 15476, 7349, 1908, 765 },
{ 12555, 11159, 1654, 2035 },
{ 11158, 21445, 1908, 2416 },
{ 23350, 28049, 3432, 892 },
{ 28684, 15985, 2416, 4321 },
{ 24620, 21953, 1654, 638 },
{ 30208, 30716, 2670, 2162 },
{ 26907, 44179, 2797, 4067 },
{ 21191, 35416, 2162, 1019 },
{ 27668, 38717, 638, 3178 },
{ 3666, 50528, 2035, 1400 },
{ 15349, 48750, 2670, 1654 },
{ 28430, 7221, 2162, 892 },
{ 4808, 3158, 2416, 1273 },
{ 38464, 3666, 1527, 1781 },
{ 2777, 20937, 2289, 1146 },
{ 38209, 9254, 1908, 1781 },
{ 2269, 56497, 2289, 892 },
};
//!code-end: input-data
void load_tree()
{
//!code-start: normal-load
rt_type tree;
// Insert the rectangle objects into the tree.
int value = 0;
for (const auto& rect : rects)
tree.insert({{rect.x, rect.y}, {rect.x + rect.w, rect.y + rect.h}}, value++);
// Export the tree structure as a SVG for visualization.
std::string tree_svg = tree.export_tree(rt_type::export_tree_type::extent_as_svg);
std::ofstream fout("bounds2.svg");
fout << tree_svg;
//!code-end: normal-load
}
void bulkload_tree()
{
//!code-start: bulkload
rt_type::bulk_loader loader;
// Insert the rectangle objects into the tree.
int value = 0;
for (const auto& rect : rects)
loader.insert({{rect.x, rect.y}, {rect.x + rect.w, rect.y + rect.h}}, value++);
// Start bulk-loading the tree.
rt_type tree = loader.pack();
// Export the tree structure as a SVG for visualization.
std::string tree_svg = tree.export_tree(rt_type::export_tree_type::extent_as_svg);
std::ofstream fout("bounds2-bulkload.svg");
fout << tree_svg;
//!code-end: bulkload
}
int main() try
{
load_tree();
bulkload_tree();
return EXIT_SUCCESS;
}
catch (...)
{
return EXIT_FAILURE;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
