SFCGAL
Functions
SFCGAL::graph::algorithm Namespace Reference

Functions

template<typename V , typename E >
bool isHalfEdge (const GeometryGraphT< V, E > &graph)
 [private]Test if a bidirectional graph is an half-edge (in order to validate orientation) More...
 
template<typename Graph >
void studyOrientation (Graph &graph, std::vector< typename Graph::edge_descriptor > &reference, std::vector< typename Graph::edge_descriptor > &target, bool &hasOppositeEdge, bool &hasParallelEdge)
 [private]Study orientation between two EdgeStrings More...
 
template<typename Graph >
bool makeConsistentOrientation (Graph &graph, std::vector< typename Graph::edge_descriptor > &reference, std::vector< typename Graph::edge_descriptor > &target)
 Try to build consistent orientation between two edge string. More...
 

Function Documentation

◆ isHalfEdge()

template<typename V , typename E >
bool SFCGAL::graph::algorithm::isHalfEdge ( const GeometryGraphT< V, E > &  graph)

[private]Test if a bidirectional graph is an half-edge (in order to validate orientation)

◆ makeConsistentOrientation()

template<typename Graph >
bool SFCGAL::graph::algorithm::makeConsistentOrientation ( Graph &  graph,
std::vector< typename Graph::edge_descriptor > &  reference,
std::vector< typename Graph::edge_descriptor > &  target 
)

Try to build consistent orientation between two edge string.

Returns
true on success

◆ studyOrientation()

template<typename Graph >
void SFCGAL::graph::algorithm::studyOrientation ( Graph &  graph,
std::vector< typename Graph::edge_descriptor > &  reference,
std::vector< typename Graph::edge_descriptor > &  target,
bool &  hasOppositeEdge,
bool &  hasParallelEdge 
)

[private]Study orientation between two EdgeStrings

Returns
true on success