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

Remove Window_stream

This commit is contained in:
Andreas Fabri 2007-03-20 22:04:11 +00:00
parent 13f54fc5e2
commit 40d91a08fd
2 changed files with 0 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
Kernel_d/doc_tex/Convex_hull_d_ref/Convex_hull_d.tex
View File

@ -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} \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> \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 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

5
Kernel_d/doc_tex/Convex_hull_d_ref/Delaunay_d.tex
View File

@ -322,12 +322,7 @@ and uses the following function objects from the kernel traits \ccc{R}:
\ccHeading{Low Dimensional Output Routines} \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> \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 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