mirror of https://github.com/CGAL/cgal
71 lines
2.4 KiB
C++
71 lines
2.4 KiB
C++
// Implementation: Testprogram for 2-dimensional Segment Trees
|
|
// Example for the construction of a two dimensional segment tree.
|
|
// The data type of the first dimension is double and for the second
|
|
// dimension double.
|
|
// The elements that should be stored in the tree are pushed into
|
|
// a list. Then a two dimensional segment tree is created and a
|
|
// window query is performed.
|
|
|
|
#include <iostream>
|
|
#include <utility>
|
|
#include <vector>
|
|
#include <iterator>
|
|
#include <list>
|
|
#include <CGAL/Simple_cartesian.h>
|
|
#include <CGAL/Segment_tree_k.h>
|
|
#include <CGAL/Range_segment_tree_traits.h>
|
|
|
|
typedef CGAL::Simple_cartesian<double> K;
|
|
typedef CGAL::Range_segment_tree_set_traits_2<K> Traits;
|
|
typedef CGAL::Segment_tree_2<Traits > Segment_tree_2_type;
|
|
|
|
int main()
|
|
{
|
|
typedef Traits::Interval 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(Key(1,5), Key(2,7)));
|
|
InputList.push_back(Interval(Key(2,7), Key(3,8)));
|
|
InputList.push_back(Interval(Key(6,9), Key(9,13)));
|
|
InputList.push_back(Interval(Key(1,3), Key(3,9)));
|
|
|
|
// 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(Key(3,6), Key(7,12));
|
|
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.x() << "-" << (*j).second.x() << " "
|
|
<< (*j).first.y() << "-" << (*j).second.y() << std::endl;
|
|
j++;
|
|
}
|
|
std::cerr << "\n enclosing_query (6,10),(7,11) \n";
|
|
Interval b=Interval(Key(6,10),Key(7,11));
|
|
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.x() << "-" << (*j).second.x() << " "
|
|
<< (*j).first.y() << "-" << (*j).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;
|
|
}
|