|
SFCGAL
2.3.0
|
Graph algorithm namespace. More...
Functions | |
| template<typename V , typename E > | |
| auto | isHalfEdge (const GeometryGraphT< V, E > &graph) -> bool |
| [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 > | |
| auto | makeConsistentOrientation (Graph &graph, std::vector< typename Graph::edge_descriptor > &reference, std::vector< typename Graph::edge_descriptor > &target) -> bool |
| Try to build consistent orientation between two edge string. More... | |
Graph algorithm namespace.
| auto SFCGAL::graph::algorithm::isHalfEdge | ( | const GeometryGraphT< V, E > & | graph | ) | -> bool |
| auto SFCGAL::graph::algorithm::makeConsistentOrientation | ( | Graph & | graph, |
| std::vector< typename Graph::edge_descriptor > & | reference, | ||
| std::vector< typename Graph::edge_descriptor > & | target | ||
| ) | -> bool |
Try to build consistent orientation between two edge string.
| Graph | The graph type |
| graph | The geometry graph |
| reference | Reference edge vector |
| target | Target edge vector |
| 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
| Graph | The graph type |
| graph | The geometry graph |
| reference | Reference edge vector |
| target | Target edge vector |
| hasOppositeEdge | Output flag for opposite edge detection |
| hasParallelEdge | Output flag for parallel edge detection |
1.8.10