From 40d91a08fdc72d0d92dd4da701810daa2caf6f2d Mon Sep 17 00:00:00 2001
From: Andreas Fabri <Andreas.Fabri@geometryfactory.com>
Date: Tue, 20 Mar 2007 22:04:11 +0000
Subject: [PATCH] Remove Window_stream

---
 Kernel_d/doc_tex/Convex_hull_d_ref/Convex_hull_d.tex | 5 -----
 Kernel_d/doc_tex/Convex_hull_d_ref/Delaunay_d.tex    | 5 -----
 2 files changed, 10 deletions(-)

diff --git a/Kernel_d/doc_tex/Convex_hull_d_ref/Convex_hull_d.tex b/Kernel_d/doc_tex/Convex_hull_d_ref/Convex_hull_d.tex
index 07ef7afc5b1..537a19f7708 100644
--- a/Kernel_d/doc_tex/Convex_hull_d_ref/Convex_hull_d.tex
+++ b/Kernel_d/doc_tex/Convex_hull_d_ref/Convex_hull_d.tex
@@ -327,12 +327,7 @@ void convex_hull_d_to_polyhedron_3(   const Convex_hull_d<R>& C, Polyhedron_3<T,
 }
 
 \ccHeading{Low Dimensional Output Routines}
-include \ccc{<CGAL/IO/Convex_hull_d_window_stream.h>}
 
-\ccFunction{template <class R>
-void d2_show(const Convex_hull_d<R>& C, CGAL::Window_stream& W);}{draws the convex hull \ccc{C} in window \ccc{W}.\\
-\ccPrecond \ccc{dim == 2}.  
-}
 
 \ccFunction{template <class R>
 void d3_surface_map(const Convex_hull_d<R>& C, GRAPH< typename Convex_hull_d<R>::Point_d ,int>& G);}{constructs the representation of the surface of \ccc{C} as a 
diff --git a/Kernel_d/doc_tex/Convex_hull_d_ref/Delaunay_d.tex b/Kernel_d/doc_tex/Convex_hull_d_ref/Delaunay_d.tex
index 55713278d1f..0a4327982d6 100644
--- a/Kernel_d/doc_tex/Convex_hull_d_ref/Delaunay_d.tex
+++ b/Kernel_d/doc_tex/Convex_hull_d_ref/Delaunay_d.tex
@@ -322,12 +322,7 @@ and uses the following function objects from the kernel traits \ccc{R}:
 
 
 \ccHeading{Low Dimensional Output Routines}
-include \ccc{<CGAL/IO/Delaunay_d_window_stream.h>}
 
-\ccFunction{template <typename R, typename Lifted_R>
-template <typename R, typename Lifted_R> void d2_show(const Delaunay_d<R,Lifted_R>& D,              CGAL::Window_stream& W,               typename Delaunay_d<R,Lifted_R>::Delaunay_voronoi_kind k =               Delaunay_d<R,Lifted_R>::NEAREST) ;}{draws the underlying simplicial complex \ccc{D} into window \ccc{W}.\\
-\ccPrecond \ccc{dim == 2}.  
-}
 
 \ccFunction{template <typename R, typename Lifted_R>
 template <typename R, typename Lifted_R> void d2_map(const Delaunay_d<R,Lifted_R>& D,              GRAPH< typename Delaunay_d<R,Lifted_R>::Point_d, int >& DTG,              typename Delaunay_d<R,Lifted_R>::Delaunay_voronoi_kind k =              Delaunay_d<R,Lifted_R>::NEAREST) ;}{constructs a LEDA graph representation of the nearest