Information Technology Reference
In-Depth Information
NW
N E
v
(x,y)
W
E
SW
S
SE
Fig. 3.
On the left side: Cluster Analysis - Pixel removal on top and pixel shifting below. On the
right side: Possible neighbor directions.
Fig. 4.
Extracting the graph and relevant topological information. Example of a simple tree-like
graph with 12 vertices.
4.4
Extracting Relevant Topological Information
The last step of the algorithm is to compute the rest of the topological information to
completely characterize the graph (edges, connectivity, etc.). In this work, each vertex
data structure will have the following fields associated to it:
•
ID
•
Coordinates (x, y)
•
Degree
•
Neighbors (Vertex Degree)=
{
ID, direction, edge weight
}
