Skip to main content
Advertisement

< Back to Article

Finding landmarks - An investigation of viewing behavior during spatial navigation in VR using a graph-theoretical analysis approach

Fig 4

Graph partitioning.

(a) The sparsity pattern of the graph’s adjacency matrix sorted by the entries in second smallest eigenvector. Color coded into edges between nodes of one cluster (green), edges between nodes of the other cluster (blue), edges between nodes of the two clusters (black) and a distinction between the clusters (yellow). (b) The two clusters are displayed onto the map of participant 35. (c) The second smallest eigenvector of the Laplacian matrix is sorted ascendingly and color coded into two clusters.

Fig 4

doi: https://doi.org/10.1371/journal.pcbi.1009485.g004