Multiscale Visualization of Small World Networks
Academic design encodes multiscale node-link structure with edge weakness and hierarchical decomposition, while the notebook only produces unrelated bar/heatmap/scatter plots of Pokémon stats.
Multiscale Visualization of Small World Networks
No evidence of the paper’s multiscale node-link decomposition, edge weakness metric, or hierarchical subgraph layout; repository only shows generic networkx plots.
Multiscale Visualization of Small World Networks
Academic design’s edge-weakness metric, hierarchical subgraph layouts, and semantic-zoom node-link views are absent; only a basic histogram and generic networkx plot appear.
Multiscale Visualization of Small World Networks
The repo only outputs static nx.draw calls with no edge-weakness colouring, subgraph decomposition, or hierarchical layout, so every multiscale encoding channel is absent.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The academic design’s animated node-link MST vs PFNET comparison is replaced by static charts (area, glyph, heatmap, histogram, scatter) that do not encode network topology or evolution.
Multiscale Visualization of Small World Networks
The repo uses a basic spring-layout node-link plot with no multiscale hierarchy, edge-weakness colouring, or semantic-zoom layers that the paper’s design prescribes.
Multiscale Visualization of Small World Networks
Academic design’s edge-weakness metric and hierarchical multiscale decomposition are replaced by a single Louvain community partition and static node-link layout.
Multiscale Visualization of Small World Networks
The academic paper's multiscale, hierarchical node-link with edge-weakness filtering is reduced to a single-level co-authorship network, losing the multiscale decomposition and semantic zoom encodings.
Multiscale Visualization of Small World Networks
The academic node-link multiscale view with edge-weakness filtering and hierarchical subgraphs is absent; only static bar/histogram charts appear.
Multiscale Visualization of Small World Networks
The academic design’s multiscale node-link decomposition and edge-weakness encoding are absent; the notebook only shows generic bar/scatter plots of word counts.
Multiscale Visualization of Small World Networks
The repo uses a plain spring-layout node-link plot with a single categorical color channel, completely omitting the paper’s multiscale hierarchical decomposition, edge-weakness metric, and semantic-zoom-based visual encodings.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The academic paper's animated node-link evolution with MST/PFNET link reduction is replaced by static bar/heatmap plots of Pokémon stats, losing the temporal network encoding entirely.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The academic design’s animated node-link evolution comparing MST vs PFNET topologies is reduced to a static histogram of class labels, losing the temporal and structural encodings entirely.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
Academic design animates evolving MST vs PFNET topologies with link-reduction semantics, while the repo produces a static Louvain-coloured node-link diagram lacking time, link pruning, or path semantics.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The academic paper’s animated node-link MST/PFNET evolution is reduced to static bar/histogram counts, losing the time-varying network topology and link-reduction comparison entirely.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The repo uses a static spring-layout node-link diagram with no MST/PFNET pruning, edge weight animation, or topology-preserving layout that the paper requires for comparing evolving co-citation structures.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The repository implementation drops several key visual channels and encoding axes present in the academic design, such as the use of minimum spanning trees and pathfinder networks for network visualization.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The repository implementation simplifies the encoding by primarily focusing on bar, node-link, and scatter charts, deviating from the academic design's emphasis on minimum spanning trees and pathfinder networks for evolving network visualization.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The encoding drift is major because the academic design relies on dynamic network topology preservation and link reduction algorithms, whereas the repository implementation uses a static node-link diagram with limited encoding capabilities.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The implementation primarily utilizes node-link diagrams with varying layouts, whereas the academic design focuses on animated visualizations of evolving networks using minimum spanning trees and pathfinder networks, indicating a significant encoding drift.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The repository implementation simplifies the visual encoding by primarily using standard node-link diagrams without radial focus+context layout, level highlighting, or secondary foci as described in the academic design.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The repository implementation lacks the unique radial focus+context layout and image-bearing node visualization features described in the academic design.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The repository implementation lacks the radial focus+context layout and visual node display of the academic design, instead using various chart types with simplified encoding.
Exploring high-D spaces with multiform matrices and small multiples
The repository implementation simplifies the encoding by using only a Node-Link diagram without incorporating multiform matrices, small multiples, or conditional entropy ordering as described in the academic design.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The repository implementation simplifies the encoding by primarily using bar charts and histograms instead of the radial focus+context visualization and node-link diagrams described in the academic design.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The implementation replaces the radial focus+context layout and image-bearing nodes with a simple spring layout and generic circles, dropping key visual channels.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The implementation uses a static graphviz layout and plain colored nodes, dropping the radial focus+context layout, image-bearing nodes, and interactive encodings.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The code uses generic networkx/pyvis graphs lacking the radial focus+context layout and image‑bearing visual nodes of MoireGraphs.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The implementation uses generic static node‑link (or other chart types) without the radial focus+context layout, image nodes, or animated transitions described in the paper.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The implementation uses a basic spring layout and simple colour encoding, dropping the radial focus+context layout and image‑bearing nodes of MoireGraphs.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The implementation replaces the radial focus+context layout and image-bearing nodes with uniform static node‑link drawings, losing key visual channels.
Edgelens: an interactive method for managing edge congestion in graphs
The notebook lacks EdgeLens-specific encodings like interactive edge curvature, transparency, and multiple lens overlays, reducing the visual encoding to basic static node-link plots.
Edgelens: an interactive method for managing edge congestion in graphs
The notebook uses static matplotlib plots and a simple histogram, dropping the EdgeLens node‑link layout, curvature, transparency and multi‑lens encodings required by the paper.
Edgelens: an interactive method for managing edge congestion in graphs
The notebook uses heatmaps, boxplots, etc., not the node‑link with EdgeLens encoding described in the paper.
Edgelens: an interactive method for managing edge congestion in graphs
The implementation uses a basic static node‑link layout with no edge curvature, lenses, transparency, or colour encoding required by EdgeLens, simplifying the visual encoding substantially.
Edgelens: an interactive method for managing edge congestion in graphs
The implementation drops EdgeLens curvature, transparency, multiple lenses and uses static colour‑by‑community, a major deviation from the paper’s encodings.
Edgelens: an interactive method for managing edge congestion in graphs
The implementation uses a generic node‑link graph without EdgeLens curvature, transparency, or multiple lens overlays, abandoning the paper's specialized encodings.
Edgelens: an interactive method for managing edge congestion in graphs
Implementation uses static bar/histogram plots, omitting the node-link graph, edge curvature, and lens encodings required by EdgeLens.
Edgelens: an interactive method for managing edge congestion in graphs
The notebook lacks the node‑link EdgeLens visual encoding entirely, using generic plots unrelated to edge curvature or transparency.
Edgelens: an interactive method for managing edge congestion in graphs
The implementation uses a static spring layout without edge curvature, lenses, transparency or multi‑channel encodings that are central to EdgeLens.
Edgelens: an interactive method for managing edge congestion in graphs
The implementation replaces EdgeLens curvature, transparency, and multi‑lens overlays with basic static node‑link drawings using simple color and size encodings.
Exploring high-D spaces with multiform matrices and small multiples
The notebook uses a basic node‑link plot without the multiform matrices, small multiples, conditional‑entropy ordering, or coordinated views described in the paper.
Exploring high-D spaces with multiform matrices and small multiples
The notebook replaces the paper's multiform matrices, small multiples, and coordinated views with a simple histogram and basic node‑link, losing the complex encodings and layout.
Exploring high-D spaces with multiform matrices and small multiples
The notebook replaces the paper's multiform matrix/small multiples and coordinated views with simple static heatmaps and boxplots, losing key visual encodings.
Exploring high-D spaces with multiform matrices and small multiples
The notebook builds a co‑authorship network using pyvis instead of the paper's multiform bivariate matrix/small‑multiple coordinated views, dropping the intended multi‑encoding layout.
Exploring high-D spaces with multiform matrices and small multiples
Implementation reduces the design to a single static node‑link graph, dropping the multi‑form matrices, small multiples, conditional entropy ordering and coordinated views.
Exploring high-D spaces with multiform matrices and small multiples
The implementation uses only static bar and histogram plots, dropping the node‑link, matrix and small‑multiple encodings central to the paper.
Exploring high-D spaces with multiform matrices and small multiples
The implementation uses generic bar/scatter/node‑link plots on text data instead of the paper’s coordinated multiform matrices and small multiples.
Exploring high-D spaces with multiform matrices and small multiples
Implementation reduces the design to a single static node‑link plot, dropping matrix/small‑multiple layouts, multivariate encodings, and coordinated views.
Exploring high-D spaces with multiform matrices and small multiples
Implementation replaces the paper's multiform matrices and coordinated small multiples with simple static node‑link drawings, dropping key encodings and layout complexity