mirror of https://github.com/CGAL/cgal
115 lines
3.8 KiB
C
115 lines
3.8 KiB
C
// ============================================================================
|
|
//
|
|
// Copyright (c) 1997 The CGAL Consortium
|
|
//
|
|
// This software and related documentation is part of the
|
|
// Computational Geometry Algorithms Library (CGAL).
|
|
//
|
|
// Every use of CGAL requires a license. Licenses come in three kinds:
|
|
//
|
|
// - For academic research and teaching purposes, permission to use and
|
|
// copy the software and its documentation is hereby granted free of
|
|
// charge, provided that
|
|
// (1) it is not a component of a commercial product, and
|
|
// (2) this notice appears in all copies of the software and
|
|
// related documentation.
|
|
// - Development licenses grant access to the source code of the library
|
|
// to develop programs. These programs may be sold to other parties as
|
|
// executable code. To obtain a development license, please contact
|
|
// the CGAL Consortium (at cgal@cs.uu.nl).
|
|
// - Commercialization licenses grant access to the source code and the
|
|
// right to sell development licenses. To obtain a commercialization
|
|
// license, please contact the CGAL Consortium (at cgal@cs.uu.nl).
|
|
//
|
|
// This software and documentation is provided "as-is" and without
|
|
// warranty of any kind. In no event shall the CGAL Consortium be
|
|
// liable for any damage of any kind.
|
|
//
|
|
// The CGAL Consortium consists of Utrecht University (The Netherlands),
|
|
// ETH Zurich (Switzerland), Free University of Berlin (Germany),
|
|
// INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Wittenberg
|
|
// (Germany) Max-Planck-Institute Saarbrucken (Germany), RISC Linz (Austria),
|
|
// and Tel-Aviv University (Israel).
|
|
//
|
|
// ----------------------------------------------------------------------
|
|
//
|
|
// release : CGAL-1.2
|
|
// release_date : 1999, January 18
|
|
//
|
|
// file : src/examples/RangeSegmentTrees/range_tree_set_2.C
|
|
// source : src/examples/RangeSegmentTrees/range_tree_set_2.C
|
|
// revision : $Revision$
|
|
// revision_date : $Date$/
|
|
// author(s) : Gabriele Neyer
|
|
//
|
|
// coordinator : Peter Widmayer, ETH Zurich
|
|
//
|
|
// Implementation: Testprogram for 2-dimensional Range Trees
|
|
// A two dimensional Range Tree is defined in this class.
|
|
// Ti is the type of each dimension of the tree.
|
|
//
|
|
// email : cgal@cs.uu.nl
|
|
//
|
|
// ======================================================================
|
|
#include <CGAL/basic.h>
|
|
#include <iostream>
|
|
#include <utility>
|
|
#include <CGAL/Cartesian.h>
|
|
#include <CGAL/Point_2.h>
|
|
#include <CGAL/Range_segment_tree_traits.h>
|
|
#include <CGAL/Range_tree_k.h>
|
|
#include <vector>
|
|
#include <iterator>
|
|
|
|
typedef CGAL::Cartesian<double> Representation;
|
|
typedef CGAL::Range_segment_tree_set_traits_2<Representation> Traits;
|
|
typedef CGAL::Range_tree_2<Traits> Range_tree_2_type;
|
|
|
|
int main()
|
|
{
|
|
typedef Traits::Key Key;
|
|
typedef Traits::Interval Interval;
|
|
// Range_tree_2_type RR;
|
|
std::vector<Key> InputList, OutputList;
|
|
std::vector<Key>::iterator first, last, current;
|
|
|
|
InputList.push_back(Key(8,5.1));
|
|
InputList.push_back(Key(1,1.1));
|
|
InputList.push_back(Key(3,2.1));
|
|
InputList.push_back(Key(2,6.1));
|
|
InputList.push_back(Key(5,4.1));
|
|
InputList.push_back(Key(4,8.1));
|
|
InputList.push_back(Key(7,7.1));
|
|
InputList.push_back(Key(6,3.1));
|
|
|
|
first = InputList.begin();
|
|
last = InputList.end();
|
|
|
|
Range_tree_2_type Range_tree_2(first,last);
|
|
|
|
Key a=Key(4,8.1);
|
|
Key b=Key(5,8.2);
|
|
Interval win=Interval(a,b);
|
|
|
|
|
|
std::cerr << std::endl << "Window Query: lower left point: (4.0,5.0),";
|
|
std::cerr << "upper right point: (8.1,8.2)" << std::endl;
|
|
Range_tree_2.window_query(win, std::back_inserter(OutputList));
|
|
current=OutputList.begin();
|
|
|
|
while(current!=OutputList.end())
|
|
{
|
|
std::cerr << (*current).x()<< "-" << (*current).y() << std::endl;
|
|
current++;
|
|
}
|
|
|
|
if(Range_tree_2.range_tree_2->is_valid())
|
|
std::cerr << "Tree is valid\n";
|
|
else
|
|
std::cerr << "Tree is not valid\n";
|
|
|
|
return 0;
|
|
}
|
|
|
|
|