Andreas Meyer
7ed1a00c04
svn merge -r 38751:38754 ~/projects/CGAL/branches/CGAL-3.3-branch svn merge -r 38773:38775 ~/projects/CGAL/branches/CGAL-3.3-branch svn merge -r 38783:38784 ~/projects/CGAL/branches/CGAL-3.3-branch svn merge -r 38795:38796 ~/projects/CGAL/branches/CGAL-3.3-branch svn merge -r 38815:38816 ~/projects/CGAL/branches/CGAL-3.3-branch svn merge -r 38827:38829 ~/projects/CGAL/branches/CGAL-3.3-branch svn merge -r 38834:38836 ~/projects/CGAL/branches/CGAL-3.3-branch
31 lines
1.2 KiB
TeX
31 lines
1.2 KiB
TeX
|
|
\ccRefChapter{CGAL and the Boost Graph Library\label{ref-chapter-BGL}}
|
|
|
|
\ccChapterAuthor{Andreas Fabri \and Fernando Cacciola \and Ron Wein}
|
|
|
|
This chapter introduces the concepts and classes that allow to interface \cgal\ data structures
|
|
with the algorithms of the {\sc Bgl}, as well as a new graph concept.
|
|
|
|
\section{Classified Reference Pages}
|
|
|
|
\ccHeading{Concepts}
|
|
\ccRefConceptPage{HalfedgeGraph}
|
|
|
|
\ccHeading{Enums}
|
|
\ccRefIdfierPage{boost::edge_index_t}\\
|
|
\ccRefIdfierPage{CGAL::edge_is_border_t}\\
|
|
\ccRefIdfierPage{CGAL::vertex_is_border_t}\\
|
|
\ccRefIdfierPage{CGAL::vertex_point_t}
|
|
|
|
\ccHeading{Classes}
|
|
\ccRefIdfierPage{boost::graph_traits< CGAL::Arrangement_2<Traits,Dcel> >}\\
|
|
\ccRefIdfierPage{boost::graph_traits< CGAL::Polyhedron_3<Traits> >}\\
|
|
\ccRefIdfierPage{CGAL::halfedge_graph_traits< CGAL::Polyhedron_3<Traits> >}\\
|
|
\ccRefIdfierPage{boost::graph_traits< CGAL::Triangulation_2<GT, TDS> >}\\
|
|
\ccRefIdfierPage{CGAL::Triangulation_vertex_base_with_id_2<TriangulationTraits_2, TriangulationVertexBase_2>}\\
|
|
\ccRefIdfierPage{CGAL::HalfedgeDS_vertex_max_base_with_id<Refs>}\\
|
|
\ccRefIdfierPage{CGAL::HalfedgeDS_halfedge_max_base_with_id<Refs>}\\
|
|
\ccRefIdfierPage{CGAL::HalfedgeDS_face_max_base_with_id<Refs>}\\
|
|
\ccRefIdfierPage{CGAL::Polyhedron_items_with_id_3}
|
|
|