CGAL 5.6.3 - L Infinity Segment Delaunay Graphs

Loading...
Searching...
No Matches
Segment_Delaunay_graph_Linf_2/sdg-count-sites-linf.cpp
// standard includes
#include <iostream>
#include <fstream>
#include <cassert>
// define the input kernel
#include <CGAL/Simple_cartesian.h>
typedef CGAL::Simple_cartesian<double> CK;
// typedefs for the traits and the algorithm
#include <CGAL/Segment_Delaunay_graph_Linf_filtered_traits_2.h>
#include <CGAL/Segment_Delaunay_graph_Linf_2.h>
typedef CGAL::Segment_Delaunay_graph_Linf_filtered_traits_2<
CK,CGAL::Field_with_sqrt_tag> Gt;
typedef CGAL::Segment_Delaunay_graph_Linf_2<Gt> SDG2;
using namespace std;
int main( int argc, char *argv[] ) {
if ( ! (( argc == 1 ) || (argc == 2)) ) {
std::cout <<"usage: "<< argv[0] <<" [filename]\n";
}
ifstream ifs( (argc == 1) ? "data/sitesx.cin" : argv[1] );
assert( ifs );
SDG2 sdg;
SDG2::Site_2 site;
while ( ifs >> site ) { sdg.insert( site ); }
ifs.close();
assert( sdg.is_valid(true, 1) );
cout << endl << endl;
// print the number of input and output sites
cout << "# of input sites : " << sdg.number_of_input_sites() << endl;
cout << "# of output sites: " << sdg.number_of_output_sites() << endl;
unsigned int n_ipt(0), n_iseg(0), n_opt(0), n_oseg(0), n_ptx(0);
// count the number of input points and input segments
SDG2::Input_sites_iterator iit;
for (iit = sdg.input_sites_begin(); iit != sdg.input_sites_end(); ++iit)
{
if ( iit->is_point() ) { n_ipt++; } else { n_iseg++; }
}
// count the number of output points and output segments, as well
// as the number of points that are points of intersection of pairs
// of strongly intersecting sites
SDG2::Output_sites_iterator oit;
for (oit = sdg.output_sites_begin(); oit != sdg.output_sites_end(); ++oit)
{
if ( oit->is_segment() ) { n_oseg++; } else {
n_opt++;
if ( !oit->is_input() ) { n_ptx++; }
}
}
cout << endl << "# of input segments: " << n_iseg << endl;
cout << "# of input points: " << n_ipt << endl << endl;
cout << "# of output segments: " << n_oseg << endl;
cout << "# of output points: " << n_opt << endl << endl;
cout << "# of intersection points: " << n_ptx << endl;
return 0;
}
CGAL::Segment_Delaunay_graph_Linf_2
The class Segment_Delaunay_graph_Linf_2 represents the segment Delaunay graph under the metric (whic...
Definition: Segment_Delaunay_graph_Linf_2.h:34
std
STL namespace.
CGAL::Field_with_sqrt_tag
CGAL::Segment_Delaunay_graph_Linf_filtered_traits_2
The class Segment_Delaunay_graph_Linf_filtered_traits_2 provides a model for the SegmentDelaunayGraph...
Definition: Segment_Delaunay_graph_Linf_filtered_traits_2.h:30
CGAL::Simple_cartesian