Connectivity_encoding.h File Reference

#include <boost/graph/graph_traits.hpp>
#include <boost/graph/properties.hpp>
#include "FEVV/Tools/Comparator/Spanning_tree_vertex_edge_comparator.hpp"
#include "FEVV/Filters/CGAL/Progressive_Compression/Compression/Memory_comparator.h"
#include "FEVV/Filters/CGAL/Progressive_Compression/apply_color.h"

Include dependency graph for Connectivity_encoding.h:

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

Go to the source code of this file.

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

Functions
template<typename HalfedgeGraph , typename PointMap , typename halfedge_descriptor = typename boost::graph_traits< HalfedgeGraph >::halfedge_descriptor, typename edge_descriptor = typename boost::graph_traits< HalfedgeGraph >::edge_descriptor, typename Geometry = typename FEVV::Geometry_traits< HalfedgeGraph >>
void	FEVV::Filters::connectivity_encoding (const HalfedgeGraph &g, const PointMap &, Collapse_info< HalfedgeGraph, PointMap > &mem, edge_descriptor starting_edge, std::list< bool > &edge_bitmask)
	Encode vertex to split' one-ring edges to expand. For a vertex to split (represented by a Collapse_info object), will encode the edges to expand in a binary stream, 1 being an edge that should be expanded and 0 being an edge that should not. Takes as arguments a graph g, a pointmap, a Collapse_info object (again, representing a vertex and many necessary refinement info), the first edge to process (see the encode_connectivity_bitmask function), and the edge/connectivity bitmask (which will receive the connectivity bitstream). More...
template<typename HalfedgeGraph , typename PointMap , typename halfedge_descriptor = typename boost::graph_traits< HalfedgeGraph >::halfedge_descriptor, typename edge_descriptor = typename boost::graph_traits< HalfedgeGraph >::edge_descriptor, typename Geometry = typename FEVV::Geometry_traits< HalfedgeGraph >>
void	FEVV::Filters::encode_connectivity_bitmask (const HalfedgeGraph &g, const PointMap &pm, std::list< Collapse_info< HalfedgeGraph, PointMap > > &list_memory, std::list< bool > &edge_bitmask, const FEVV::Comparator::Spanning_tree_vertex_edge_comparator< HalfedgeGraph, PointMap, Geometry > &spanningtree)
	Encode vertex to split' one-ring edges to expand, for all collapsed edges in the order of the sorted list list_memory. More...