Planar Embedding and Drawing
The same group on the Doxygen site.
- group Planar Embedding and Drawing
Algorithms for planarity checking, embedding and drawing.
This group contains the algorithms for planarity checking, embedding and drawing.

Classes
Class |
Description |
|---|---|
Planar embedding of an undirected simple graph. |
|
Schnyder’s planar drawing algorithm. |
|
Coloring planar graphs. |
Functions and other members
-
template< typename GR >
bool checkPlanarity( const GR & graph ) Planarity checking of an undirected simple graph.
This function implements the Boyer-Myrvold algorithm for planarity checking of an undirected simple graph. It is a simplified version of the PlanarEmbedding algorithm class because neither the embedding nor the Kuratowski subdivisons are computed.