MEPP2 Project
Classes | Namespaces | Functions
Spanning_tree_vertex_edge_comparator.hpp File Reference
#include "FEVV/Tools/Comparator/Vertex_comparators.hpp"
#include "FEVV/Operators/Geometry/triangles.hpp"
#include <CGAL/boost/graph/iterator.h>
#include <CGAL/boost/graph/helpers.h>
#include <limits>
#include <iterator>
#include <map>
#include <set>
#include <stack>
Include dependency graph for Spanning_tree_vertex_edge_comparator.hpp:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

class  FEVV::Comparator::Spanning_tree_vertex_edge_comparator< Graph, PointMap, GeometryTraits >
 

Namespaces

 FEVV
 Interfaces for plugins These interfaces will be used for different plugins.
 
 FEVV::Comparator
 

Functions

template<typename Graph >
std::list< typename boost::graph_traits< Graph >::vertex_descriptor > FEVV::Comparator::get_adjacent_vertices (typename boost::graph_traits< Graph >::vertex_descriptor v, const Graph &g)
 
template<typename Graph >
std::list< typename boost::graph_traits< Graph >::vertex_descriptor > FEVV::Comparator::get_not_processed_adjacent_vertices (typename boost::graph_traits< Graph >::vertex_descriptor v, const Graph &g, std::map< typename boost::graph_traits< Graph >::vertex_descriptor, bool > &processed_vertices, typename boost::graph_traits< Graph >::edge_descriptor min_e)
 
template<typename GeometryTraits >
double FEVV::Comparator::neighbor_regularity (const typename GeometryTraits::Point &v_s_pos, const typename GeometryTraits::Point &v_t_pos, const typename GeometryTraits::Point &v_s_t_kept_neighbor_pos, const GeometryTraits &gt)
 Compute the regularity/priority of a neighbor/adjacent point. To use to identify pivot points. More...
 
template<typename Graph , typename PointMap , typename GeometryTraits = FEVV::Geometry_traits<Graph>>
void FEVV::Comparator::stable_sort_adjacent_vertices (const Graph &, const PointMap &pm, typename boost::graph_traits< Graph >::vertex_descriptor, std::list< typename boost::graph_traits< Graph >::vertex_descriptor > &adjacent2v, const typename GeometryTraits::Point &v_s_pos, const typename GeometryTraits::Point &v_t_pos, const GeometryTraits &gt)
 stable_sort_adjacent_vertices based on true source and target positions More...
 
template<typename Graph , typename PointMap , typename GeometryTraits = FEVV::Geometry_traits<Graph>>
void FEVV::Comparator::stable_sort_adjacent_vertices (const Graph &g, const PointMap &pm, typename boost::graph_traits< Graph >::vertex_descriptor v, std::list< typename boost::graph_traits< Graph >::vertex_descriptor > &adjacent2v, const GeometryTraits &gt)
 
template<typename Graph , typename PointMap , typename GeometryTraits = FEVV::Geometry_traits<Graph>>
static Spanning_tree_vertex_edge_comparator< Graph, PointMap, GeometryTraits > FEVV::Comparator::get_spanning_tree_comparator (const Graph &g, const PointMap &pm, bool tie_break_detection=true)