\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.5.2 - 2D Segment Delaunay Graphs
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Segment_Delaunay_graph_2/sdg-fast-sp.cpp
// standard includes
#include <iostream>
#include <fstream>
#include <cassert>
// example that uses the filtered traits,
// the segment Delaunay graph and the spatial sorting
// choose the kernel
#include <CGAL/Simple_cartesian.h>
// typedefs for the traits and the algorithm
#include <CGAL/Segment_Delaunay_graph_2.h>
#include <CGAL/Segment_Delaunay_graph_filtered_traits_2.h>
int main()
{
std::ifstream ifs("data/sites.cin");
assert( ifs );
SDG2 sdg;
SDG2::Site_2 site;
std::vector<SDG2::Site_2> sites;
// read the sites
while ( ifs >> site ) {
sites.push_back(site);
}
//insert the sites all at once using spatial sorting to speed the insertion
sdg.insert( sites.begin(), sites.end(),CGAL::Tag_true() );
// validate the segment Delaunay graph
assert( sdg.is_valid(true, 1) );
return 0;
}