#include <tulip/ForEach.h>
#include <tulip/PlanarConMap.h>
#include <tulip/FaceIterator.h>
#include <tulip/PlanarityTest.h>
#include <tulip/BiconnectedTest.h>
#include <list>
#include <set>
Include dependency graph for MapTriangulation.cpp:
Namespaces | |
namespace | tlp |
Functions | |
void | treatFace (SuperGraph *graph, list< node > &face, vector< edge > &addedEdges, set< UEdge > &existEdge) |
void | initEdge (SuperGraph *graph, set< UEdge > &existEdge) |
void | saveNodesOfFaces (PlanarConMap *map, vector< list< node > > &faces) |
void | tlp::triangulate (SuperGraph *graph, vector< edge > &addedEdges) |
Variables | |
node | u |
node | v |
|
|
|
|
|
|
|
|
|
|