songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

fixed the sweep line example

This commit is contained in:
Baruch Zukerman 2006-02-05 16:39:55 +00:00
parent 0dda549728
commit bea3340c06
1 changed files with 1 additions and 36 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

37
Packages/Arrangement_2/doc_tex/Sweep_line_2/sweep_line.tex
View File

@ -50,42 +50,7 @@ The endpoints of the resulting sub segments are printed out.
\end{ccHtmlOnly}
\end{figure}
\begin{alltt}
#include <CGAL/Cartesian.h>
#include <CGAL/MP_Float.h>
#include <CGAL/Quotient.h>
#include <CGAL/Arr_segment_traits_2.h>
#include <CGAL/Sweep_line_2_algorithms.h>
#include <list>
typedef CGAL::Quotient<CGAL::MP_Float> NT;
typedef CGAL::Cartesian<NT> Kernel;
typedef CGAL::Arr_segment_traits_2<Kernel> Traits_2;
typedef Traits_2::Point_2 Point_2;
typedef Traits_2::Curve_2 Segment_2;
int main()
\{
// Construct the input segments.
std::list<Segment_2> segments;
segments.push_back (Segment_2 (Point_2 (1, 5), Point_2 (8, 5)));
segments.push_back (Segment_2 (Point_2 (1, 1), Point_2 (8, 8)));
segments.push_back (Segment_2 (Point_2 (3, 1), Point_2 (3, 8)));
segments.push_back (Segment_2 (Point_2 (8, 5), Point_2 (8, 8)));
// Compute all intersection points.
Traits_2 traits;
std::list<Point_2> pts;
get_intersection_points (segments.begin(), segments.end(),
std::back_inserter (pts), traits);
// Print the result.
std::copy (pts.begin(), pts.end(), std::cout ....);
return (0);
\}
\end{alltt}
\ccIncludeExampleCode{../examples/Arrangement_2/ex_sweep_line.C}
\section*{Design and Implementation History}
%===========================================