CGAL::Euler Namespace Reference

template<typename Graph , typename P >
boost::graph_traits< Graph > ::halfedge_descriptor	make_tetrahedron (Graph &g, const P &p0, const P &p1, const P &p2, const P &p3)
template<typename Graph >
boost::graph_traits< Graph > ::halfedge_descriptor	join_vertex (typename boost::graph_traits< Graph >::halfedge_descriptor h, Graph &g)
	joins the two vertices incident to h, (that is source(h, g) and target(h, g)) and removes source(h,g). More...
template<typename Graph >
boost::graph_traits< Graph > ::halfedge_descriptor	split_vertex (typename boost::graph_traits< Graph >::halfedge_descriptor h1, typename boost::graph_traits< Graph >::halfedge_descriptor h2, Graph &g)
	splits the target vertex v of h1 and h2, and connects the new vertex and v with a new edge. More...
template<typename Graph >
boost::graph_traits< Graph > ::halfedge_descriptor	split_edge (typename boost::graph_traits< Graph >::halfedge_descriptor h, Graph &g)
	splits the halfedge h into two halfedges inserting a new vertex that is a copy of vertex(opposite(h,g),g). More...
template<typename Graph >
boost::graph_traits< Graph > ::halfedge_descriptor	join_face (typename boost::graph_traits< Graph >::halfedge_descriptor h, Graph &g)
	joins the two faces incident to h and opposite(h,g). More...
template<typename Graph >
boost::graph_traits< Graph > ::halfedge_descriptor	split_face (typename boost::graph_traits< Graph >::halfedge_descriptor h1, typename boost::graph_traits< Graph >::halfedge_descriptor h2, Graph &g)
	splits the face incident to h1 and h2. More...
template<typename Graph >
boost::graph_traits< Graph > ::halfedge_descriptor	join_loop (typename boost::graph_traits< Graph >::halfedge_descriptor h1, typename boost::graph_traits< Graph >::halfedge_descriptor h2, Graph &g)
	glues the cycle of halfedges of h1 and h2 together. More...
template<typename Graph >
boost::graph_traits< Graph > ::halfedge_descriptor	split_loop (typename boost::graph_traits< Graph >::halfedge_descriptor h1, typename boost::graph_traits< Graph >::halfedge_descriptor h2, typename boost::graph_traits< Graph >::halfedge_descriptor h3, Graph &g)
	cuts the graph along the cycle (h1,h2,h3) changing the genus (halfedge h3 runs on the backside of the three dimensional figure below). More...
template<typename Graph >
void	remove_face (typename boost::graph_traits< Graph >::halfedge_descriptor h, Graph &g)
	removes the incident face of h and changes all halfedges incident to the face into border halfedges or removes them from the graph if they were already border halfedges. More...
template<typename Graph >
void	make_hole (typename boost::graph_traits< Graph >::halfedge_descriptor h, Graph &g)
	removes the incident face of h and changes all halfedges incident to the face into border halfedges. More...
template<typename Graph >
boost::graph_traits< Graph > ::halfedge_descriptor	add_center_vertex (typename boost::graph_traits< Graph >::halfedge_descriptor h, Graph &g)
	creates a barycentric triangulation of the face incident to h. More...
template<typename Graph >
boost::graph_traits< Graph > ::halfedge_descriptor	remove_center_vertex (typename boost::graph_traits< Graph >::halfedge_descriptor h, Graph &g)
	removes the vertex target(h, g) and all incident halfedges thereby merging all incident faces. More...
template<typename Graph >
boost::graph_traits< Graph > ::halfedge_descriptor	add_vertex_and_face_to_border (typename boost::graph_traits< Graph >::halfedge_descriptor h1, typename boost::graph_traits< Graph >::halfedge_descriptor h2, Graph &g)
	appends a new face to the border halfedge h2 by connecting the tip of h2 with the tip of h1 with two new halfedges and a new vertex and creating a new face that is incident to h2. More...
template<typename Graph >
boost::graph_traits< Graph > ::halfedge_descriptor	add_face_to_border (typename boost::graph_traits< Graph >::halfedge_descriptor h1, typename boost::graph_traits< Graph >::halfedge_descriptor h2, Graph &g)
	appends a new face incident to the border halfedge h1 and h2 by connecting the vertex target(h2,g) and the vertex target(h1,g) with a new halfedge, and filling this separated part of the hole with a new face, such that the new face is incident to h2. More...
template<typename Graph >
boost::graph_traits< Graph > ::vertex_descriptor	collapse_edge (typename boost::graph_traits< Graph >::edge_descriptor v0v1, Graph &g)
	collapses an edge in a graph. More...
template<typename Graph , typename EdgeIsConstrainedMap >
boost::graph_traits< Graph > ::vertex_descriptor	collapse_edge (typename boost::graph_traits< Graph >::edge_descriptor v0v1, Graph &g, EdgeIsConstrainedMap Edge_is_constrained_map)
	Collapses the edge v0v1 replacing it with v0 or v1, as described in the paragraph above and guarantees that an edge e2, for which get(edge_is_constrained_map, e2)==true, is not removed after the collapse. More...
template<typename Graph >
void	flip_edge (typename boost::graph_traits< Graph >::halfedge_descriptor h, Graph &g)
	performs an edge flip, rotating the edge pointed by h by one vertex in the direction of the face orientation. More...
template<typename Graph >
bool	satisfies_link_condition (typename boost::graph_traits< Graph >::edge_descriptor e, Graph &g)