#include <sparseGraph.h>
Inheritance diagram for voronoiDiagram:
Public Member Functions | |
| voronoiDiagram (abstractMixedGraph &_G, const indexSet< TNode > &_Terminals) throw () | |
| ~voronoiDiagram () throw () | |
| TFloat | UpdateSubgraph () throw () |
A Voronoi diagram (in the graph-theoretic sense) is some kind of surface graph. The constructor takes a set of terminal nodes, a partition of the node set (implicitly assigning every node to its minimum distance terminal) and the distance labels. It identifies the nodes in every part (applying the same rules as the colourContraction constructor) and assigns length labels according to the shortest path lengths between two terminal nodes.
|
||||||||||||
|
|
|
|
|
|
|
|