• Home
  • Search
  • An Algorithmic Solution for the “Hair Ball” Problem in Data Visualization
  • Cite Icon2
  • https://doi.org/10.26389/ajsrp.k220918Copy DOI Icon

An Algorithmic Solution for the “Hair Ball” Problem in Data Visualization

Show More
  • Abstract
  • Literature Map
  • Citations
  • Similar Papers
Abstract

The investigation and analysis of large and complex graphs is an important aspect of data visualization research, yet there is a need for entirely new, scalable approaches and methodologies for graph visualization. This can ultimately provide more insight into the structure and function of this complex graph (Hair Ball). To explain more, we need to find a methodology to develop a solution to present a “Tidy” graph with the minimal crossover between edges in the “Hair Balls.” In spite of the expanding significance of investigating and extensively analyzing and understanding very large graphs of data, the traditional way of visualizing graphs has difficulties scaling up, and typically ends up depicting these large graphs as “Hair Balls”. This traditional approach does indeed have a deeply intuitive foundation: nodes are depicted with a shape such as a circle, triangle or square, which are then connected by lines or curves that represent the edges. In any case, although there are many different ways to apply this basic underlying idea, it needs to be revisited in light of current and emerging needs for understanding increasingly complex crossover between edges in the graphs. The complex “Hair Ball,” which appears as an indecipherable graph, came from the crossover between edges. From our preliminary research, we found the major disadvantage in the Hair Balls graph was that it confused observers. Users may think there are some extra nodes; but in reality, there are not. Because there are many crossovers between edges in the Hair Balls, the impression also may affect observers’ understanding of the whole structure of the graph. Major problem-no effective reception of information from a “Hair Balls” graph-meaningless to observers.

Similar Papers
  • Research Article
  • Citations77

The exact distance to destination in undirected world

  • Apr 26, 2012
  • The VLDB Journal
  • Lijun Chang +4
  • Conference Article
  • Citations21

Parallel Modularity-Based Community Detection on Large-Scale Graphs

  • Sep 01, 2015
  • Jianping Zeng +1
  • Conference Article
  • Citations5

DGG, dRNG, DSC: New Degree-based Shape-based Faithfulness Metrics for Large and Complex Graph Visualization

  • Apr 01, 2022
  • Seok-Hee Hong +5
  • Dissertation

Efficient algorithms for subgraph counting and enumeration on large graphs

  • Jan 01, 2024
  • Kaixin Wang
  • Dissertation

Deep Learning on Graphs using Graph Convolutional Networks

  • May 22, 2019
  • Saurabh Mithe
  • Research Article
  • Citations5

Incremental Maximal Clique Enumeration for Hybrid Edge Changes in Large Dynamic Graphs

  • Apr 01, 2024
  • IEEE Transactions on Knowledge and Data Engineering
  • Ting Yu +8
  • PDF
  • Research Article
  • Citations7

The fake news graph analyzer: An open-source software for characterizing spreaders in large diffusion graphs

  • Nov 01, 2021
  • Software Impacts
  • Amirhosein Bodaghi +2
  • Research Article
  • Citations4

Typical large graphs with given edge and triangle densities

  • Jan 17, 2023
  • Probability Theory and Related Fields
  • Joe Neeman +2
  • Conference Article
  • Citations28

An Iterative Global Structure-Assisted Labeled Network Aligner

  • Jul 19, 2018
  • Abdurrahman Yasar +1
  • Single Book

Utilizing Visual Representation in Educational Research

  • Oct 09, 2023
  • Conference Article
  • Citations1

Structural-semantic approach for approximate frequent subgraph mining

  • Nov 01, 2015
  • Mohamed Moussaoui +2
  • Book Chapter
  • Citations8

A FastMap-Based Algorithm for Block Modeling

  • Jan 01, 2022
  • Ang Li +3
  • Book Chapter
  • Citations1

Efficient Graph Matching

  • Jan 01, 2009
  • Diego Reforgiato Recupero
  • Research Article
  • Citations56

VEGAS: Visual influEnce GrAph Summarization on Citation Networks

  • Dec 01, 2015
  • IEEE Transactions on Knowledge and Data Engineering
  • Lei Shi +3
  • Conference Article
  • Citations3

TransfQMix: Transformers for Leveraging the Graph Structure of Multi-Agent Reinforcement Learning Problems

  • May 30, 2023
  • Matteo Gallici +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.