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
|
// Implementation: Testprogram for 2-dimensional Segment Trees
// A two dimensional Segment Tree is defined in this class.
// Ti is the type of each dimension of the tree.
#include <iostream>
#include <utility>
#include <vector>
#include <iterator>
#include <list>
#include <CGAL/Cartesian.h>
#include <CGAL/Segment_tree_k.h>
#include <CGAL/Range_segment_tree_traits.h>
typedef CGAL::Cartesian<double> Representation;
typedef CGAL::Segment_tree_map_traits_2<Representation, char> Traits;
typedef CGAL::Segment_tree_2<Traits > Segment_tree_2_type;
int main()
{
typedef Traits::Interval Interval;
typedef Traits::Pure_interval Pure_interval;
typedef Traits::Key Key;
// definition of the two-dimensional segment tree
std::list<Interval> InputList, OutputList, N;
// insertion of the tree elements into the sequence container
InputList.push_back(Interval(Pure_interval(Key(1,5), Key(2,7)),'a'));
InputList.push_back(Interval(Pure_interval(Key(2,7), Key(3,8)),'b'));
InputList.push_back(Interval(Pure_interval(Key(6,9), Key(9,13)),'c'));
InputList.push_back(Interval(Pure_interval(Key(1,3), Key(3,9)),'d'));
// creation of the segment tree
std::list<Interval>::iterator first = InputList.begin();
std::list<Interval>::iterator last = InputList.end();
Segment_tree_2_type Segment_tree_2(first,last);
// perform a window query
Interval a=Interval(Pure_interval(Key(3,6), Key(7,12)),'e');
Segment_tree_2.window_query(a,std::back_inserter(OutputList));
// output of the querey elements on stdout
std::list<Interval>::iterator j = OutputList.begin();
std::cerr << "\n window_query (3,6),(7,12)\n";
while(j!=OutputList.end())
{
std::cerr << (*j).first.first.x() << "-" << (*j).first.second.x() << " "
<< (*j).first.first.y() << "-" << (*j).first.second.y() << std::endl;
j++;
}
Interval b=Interval(Pure_interval(Key(6,10),Key(7,11)), 'f');
Segment_tree_2.enclosing_query(b,std::back_inserter(N));
j = N.begin();
std::cerr << "\n enclosing_query (6,10),(7,11)\n";
while(j!=N.end())
{
std::cerr << (*j).first.first.x() << "-" << (*j).first.second.x() << " "
<< (*j).first.first.y() << "-" << (*j).first.second.y() << std::endl;
j++;
}
if(Segment_tree_2.segment_tree_2->is_valid())
std::cerr << "Tree is valid\n";
else
std::cerr << "Tree is not valid\n";
return 0;
}
|
