mirror of https://github.com/CGAL/cgal
55 lines
1.2 KiB
C++
55 lines
1.2 KiB
C++
// standard includes
|
|
|
|
#define CGAL_SDG_VERBOSE
|
|
|
|
#ifndef CGAL_SDG_VERBOSE
|
|
#define CGAL_SDG_DEBUG(a)
|
|
#else
|
|
#define CGAL_SDG_DEBUG(a) { a }
|
|
#endif
|
|
|
|
#include <iostream>
|
|
#include <fstream>
|
|
#include <cassert>
|
|
|
|
// example that uses the filtered traits and
|
|
// the segment Delaunay graph hierarchy
|
|
|
|
// choose the kernel
|
|
#include <CGAL/Simple_cartesian.h>
|
|
|
|
struct Rep : public CGAL::Simple_cartesian<double> {};
|
|
|
|
// typedefs for the traits and the algorithm
|
|
#include <CGAL/Segment_Delaunay_graph_Linf_hierarchy_2.h>
|
|
#include <CGAL/Segment_Delaunay_graph_Linf_filtered_traits_2.h>
|
|
|
|
struct Gt
|
|
: public CGAL::Segment_Delaunay_graph_Linf_filtered_traits_2<Rep> {};
|
|
|
|
typedef CGAL::Segment_Delaunay_graph_Linf_hierarchy_2<Gt> SDG2;
|
|
|
|
|
|
int main( int argc, char *argv[] )
|
|
{
|
|
if ( not (( argc == 1 ) or (argc == 2)) ) {
|
|
std::cout <<"usage: "<< argv[0] <<" [filename]\n";
|
|
}
|
|
|
|
std::ifstream ifs( (argc == 1) ? "data/sites.cin" : argv[1] );
|
|
assert( ifs );
|
|
|
|
SDG2 sdg;
|
|
SDG2::Site_2 site;
|
|
|
|
// read the sites and insert them in the segment Delaunay graph
|
|
while ( ifs >> site ) {
|
|
sdg.insert(site);
|
|
}
|
|
|
|
// validate the segment Delaunay graph
|
|
assert( sdg.is_valid(true, 1) );
|
|
|
|
return 0;
|
|
}
|