3.50 (17 Sep 2003) [rursu]

- Changed example in the doc. Using ch_example_from_cin_to_cout.C from now on.

Packages/Convex_hull_2/changes.txt

@@ -1,3 +1,6 @@
+3.50 (17 Sep 2003) [rursu]
+- Changed example in the doc. Using ch_example_from_cin_to_cout.C from now on.
+
 3.49 (10 Sep 2003)
 - Qt_help_window class is in the namespace CGAL
 

Packages/Convex_hull_2/doc_tex/Convex_hull_2/convex_hull_2.tex

@@ -56,18 +56,15 @@ simple polygonal chains (or polygons) is available through the function
 \ccc{ch_melkman}\ccIndexMainItem[C]{ch_melkman}.%
 \ccIndexSubitem{convex hull, 2D}{of polyline or polygon}
 
-\section{Example using Bykat's algorithm}
+\section{Example using GrahamAndrew's algorithm}
 
-In the following example a convex hull is constructed from point data read
-from standard input using Bykat's algorithm.  The resulting convex polygon
-is stored in a \ccc{CGAL::Polygon_2} and then it is shown in a \cgal\ window.
-The default traits class is used here.  The same results could be
-achieved by substituting the function \ccc{CGAL::ch_bykat} for
-\ccc{CGAL::convex_hull_2}, since the latter calls the former when the
-input points are specified using input interators.
-
-\ccIncludeExampleCode{Convex_hull_2/convex_hull_2.C}
+In the following example a convex hull is constructed from point data read 
+from standard input using \ccc{Graham_Andrew} algorithm. The resulting convex 
+polygon is shown at the standard ouput console. The same results could be 
+achieved by substituting the function \ccc{CGAL::ch_graham_andrew} by other 
+function like \ccc{CGAL::ch_bykat}.
 
+\ccIncludeExampleCode{../examples/Convex_hull_2/ch_example_from_cin_to_cout.C}
 
 
 \section{Extreme Points and Hull Subsequences}

Packages/Convex_hull_2/doc_tex/basic/Convex_hull_2/convex_hull_2.tex

@@ -56,18 +56,15 @@ simple polygonal chains (or polygons) is available through the function
 \ccc{ch_melkman}\ccIndexMainItem[C]{ch_melkman}.%
 \ccIndexSubitem{convex hull, 2D}{of polyline or polygon}
 
-\section{Example using Bykat's algorithm}
+\section{Example using GrahamAndrew's algorithm}
 
-In the following example a convex hull is constructed from point data read
-from standard input using Bykat's algorithm.  The resulting convex polygon
-is stored in a \ccc{CGAL::Polygon_2} and then it is shown in a \cgal\ window.
-The default traits class is used here.  The same results could be
-achieved by substituting the function \ccc{CGAL::ch_bykat} for
-\ccc{CGAL::convex_hull_2}, since the latter calls the former when the
-input points are specified using input interators.
-
-\ccIncludeExampleCode{Convex_hull_2/convex_hull_2.C}
+In the following example a convex hull is constructed from point data read 
+from standard input using \ccc{Graham_Andrew} algorithm. The resulting convex 
+polygon is shown at the standard ouput console. The same results could be 
+achieved by substituting the function \ccc{CGAL::ch_graham_andrew} by other 
+function like \ccc{CGAL::ch_bykat}.
 
+\ccIncludeExampleCode{../examples/Convex_hull_2/ch_example_from_cin_to_cout.C}
 
 
 \section{Extreme Points and Hull Subsequences}