SPAR/AIModule/BWTA/vendors/CGAL/CGAL/boost/graph/halfedge_graph_traits_Polyhedron_3.h File Reference

#include <CGAL/HalfedgeDS_items_decorator.h>
#include <CGAL/boost/graph/graph_traits_Polyhedron_3.h>
#include <CGAL/boost/graph/halfedge_graph_traits.h>
#include <CGAL/boost/graph/halfedge_graph_traits_HalfedgeDS.h>

Include dependency graph for halfedge_graph_traits_Polyhedron_3.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	halfedge_graph_traits< CGAL::Polyhedron_3< Gt, I, HDS, A > const >
struct	halfedge_graph_traits< CGAL::Polyhedron_3< Gt, I, HDS, A > >
Defines
#define	CGAL_HDS_PARAM_   template < class Traits, class Items, class Alloc> class HDS
Functions
template<class Gt , class I , CGAL_HDS_PARAM_ , class A >
std::pair< typename halfedge_graph_traits < Polyhedron_3< Gt, I, HDS, A > const > ::undirected_edge_iterator,typename halfedge_graph_traits < Polyhedron_3< Gt, I, HDS, A > const > ::undirected_edge_iterator >	undirected_edges (Polyhedron_3< Gt, I, HDS, A > const &p)
template<class Gt , class I , CGAL_HDS_PARAM_ , class A >
boost::graph_traits < Polyhedron_3< Gt, I, HDS, A > const >::edge_descriptor	next_edge (typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > const >::edge_descriptor outedge, Polyhedron_3< Gt, I, HDS, A > const &)
template<class Gt , class I , CGAL_HDS_PARAM_ , class A >
boost::graph_traits < Polyhedron_3< Gt, I, HDS, A > const >::edge_descriptor	prev_edge (typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > const >::edge_descriptor outedge, Polyhedron_3< Gt, I, HDS, A > const &)
template<class Gt , class I , CGAL_HDS_PARAM_ , class A >
boost::graph_traits < Polyhedron_3< Gt, I, HDS, A > const >::edge_descriptor	opposite_edge (typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > const >::edge_descriptor e, Polyhedron_3< Gt, I, HDS, A > const &)
template<class Gt , class I , CGAL_HDS_PARAM_ , class A >
boost::graph_traits < Polyhedron_3< Gt, I, HDS, A > const >::edge_descriptor	next_edge_ccw (typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > const >::edge_descriptor outedge, Polyhedron_3< Gt, I, HDS, A > const &)
template<class Gt , class I , CGAL_HDS_PARAM_ , class A >
boost::graph_traits < Polyhedron_3< Gt, I, HDS, A > const >::edge_descriptor	next_edge_cw (typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > const >::edge_descriptor outedge, Polyhedron_3< Gt, I, HDS, A > const &)
template<class Gt , class I , CGAL_HDS_PARAM_ , class A >
std::pair< typename halfedge_graph_traits < Polyhedron_3< Gt, I, HDS, A > >::undirected_edge_iterator,typename halfedge_graph_traits < Polyhedron_3< Gt, I, HDS, A > >::undirected_edge_iterator >	undirected_edges (Polyhedron_3< Gt, I, HDS, A > &p)
template<class Gt , class I , CGAL_HDS_PARAM_ , class A >
boost::graph_traits < Polyhedron_3< Gt, I, HDS, A > >::edge_descriptor	next_edge (typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > >::edge_descriptor outedge, Polyhedron_3< Gt, I, HDS, A > &)
template<class Gt , class I , CGAL_HDS_PARAM_ , class A >
boost::graph_traits < Polyhedron_3< Gt, I, HDS, A > >::edge_descriptor	prev_edge (typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > >::edge_descriptor outedge, Polyhedron_3< Gt, I, HDS, A > &)
template<class Gt , class I , CGAL_HDS_PARAM_ , class A >
boost::graph_traits < Polyhedron_3< Gt, I, HDS, A > >::edge_descriptor	opposite_edge (typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > >::edge_descriptor e, Polyhedron_3< Gt, I, HDS, A > &)
template<class Gt , class I , CGAL_HDS_PARAM_ , class A >
boost::graph_traits < Polyhedron_3< Gt, I, HDS, A > >::edge_descriptor	next_edge_ccw (typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > >::edge_descriptor outedge, Polyhedron_3< Gt, I, HDS, A > &)
template<class Gt , class I , CGAL_HDS_PARAM_ , class A >
boost::graph_traits < Polyhedron_3< Gt, I, HDS, A > >::edge_descriptor	next_edge_cw (typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > >::edge_descriptor outedge, Polyhedron_3< Gt, I, HDS, A > &)

---

Define Documentation

#define CGAL_HDS_PARAM_   template < class Traits, class Items, class Alloc> class HDS

---

Function Documentation

template<class Gt , class I , CGAL_HDS_PARAM_ , class A >

boost::graph_traits< Polyhedron_3<Gt,I,HDS,A> const>::edge_descriptor next_edge	(	typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > const >::edge_descriptor	outedge,
		Polyhedron_3< Gt, I, HDS, A > const &
	)

Here is the caller graph for this function:

template<class Gt , class I , CGAL_HDS_PARAM_ , class A >

boost::graph_traits< Polyhedron_3<Gt,I,HDS,A> >::edge_descriptor next_edge	(	typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > >::edge_descriptor	outedge,
		Polyhedron_3< Gt, I, HDS, A > &
	)

template<class Gt , class I , CGAL_HDS_PARAM_ , class A >

boost::graph_traits< Polyhedron_3<Gt,I,HDS,A> const>::edge_descriptor next_edge_ccw	(	typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > const >::edge_descriptor	outedge,
		Polyhedron_3< Gt, I, HDS, A > const &
	)

Here is the call graph for this function:

template<class Gt , class I , CGAL_HDS_PARAM_ , class A >

boost::graph_traits< Polyhedron_3<Gt,I,HDS,A> >::edge_descriptor next_edge_ccw	(	typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > >::edge_descriptor	outedge,
		Polyhedron_3< Gt, I, HDS, A > &
	)

Here is the call graph for this function:

template<class Gt , class I , CGAL_HDS_PARAM_ , class A >

boost::graph_traits< Polyhedron_3<Gt,I,HDS,A> const>::edge_descriptor next_edge_cw	(	typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > const >::edge_descriptor	outedge,
		Polyhedron_3< Gt, I, HDS, A > const &
	)

template<class Gt , class I , CGAL_HDS_PARAM_ , class A >

boost::graph_traits< Polyhedron_3<Gt,I,HDS,A> >::edge_descriptor next_edge_cw	(	typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > >::edge_descriptor	outedge,
		Polyhedron_3< Gt, I, HDS, A > &
	)

template<class Gt , class I , CGAL_HDS_PARAM_ , class A >

boost::graph_traits< Polyhedron_3<Gt,I,HDS,A> const>::edge_descriptor opposite_edge	(	typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > const >::edge_descriptor	e,
		Polyhedron_3< Gt, I, HDS, A > const &
	)

Here is the caller graph for this function:

template<class Gt , class I , CGAL_HDS_PARAM_ , class A >

boost::graph_traits< Polyhedron_3<Gt,I,HDS,A> >::edge_descriptor opposite_edge	(	typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > >::edge_descriptor	e,
		Polyhedron_3< Gt, I, HDS, A > &
	)

template<class Gt , class I , CGAL_HDS_PARAM_ , class A >

boost::graph_traits< Polyhedron_3<Gt,I,HDS,A> const>::edge_descriptor prev_edge	(	typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > const >::edge_descriptor	outedge,
		Polyhedron_3< Gt, I, HDS, A > const &
	)

Here is the call graph for this function:

Here is the caller graph for this function:

template<class Gt , class I , CGAL_HDS_PARAM_ , class A >

boost::graph_traits< Polyhedron_3<Gt,I,HDS,A> >::edge_descriptor prev_edge	(	typename boost::graph_traits< Polyhedron_3< Gt, I, HDS, A > >::edge_descriptor	outedge,
		Polyhedron_3< Gt, I, HDS, A > &
	)

template<class Gt , class I , CGAL_HDS_PARAM_ , class A >

std::pair<typename halfedge_graph_traits< Polyhedron_3<Gt,I,HDS,A> const>::undirected_edge_iterator ,typename halfedge_graph_traits< Polyhedron_3<Gt,I,HDS,A> const>::undirected_edge_iterator > undirected_edges

(

Polyhedron_3< Gt, I, HDS, A > const &

p

)

[inline]

Here is the caller graph for this function:

template<class Gt , class I , CGAL_HDS_PARAM_ , class A >

std::pair<typename halfedge_graph_traits< Polyhedron_3<Gt,I,HDS,A> >::undirected_edge_iterator ,typename halfedge_graph_traits< Polyhedron_3<Gt,I,HDS,A> >::undirected_edge_iterator > undirected_edges

(

Polyhedron_3< Gt, I, HDS, A > &

p

)

[inline]