Finding landmarks - An investigation of viewing behavior during spatial navigation in VR using a graph-theoretical analysis approach
Fig 12
Graph partitioning–Toy example.
(a) The sparsity pattern of the graph’s adjacency matrix sorted by its second smallest eigenvector. Color coded into edges between nodes of one cluster (blue), edges between nodes of the other cluster (green), edges between nodes of the two clusters (black) and a distinction between the clusters (yellow). (b) The toy graph with two color coded clusters. (c) The second smallest eigenvector of the Laplacian matrix is sorted ascendingly and color coded into two clusters by division into positive and negative components.