Improving readability of static, straight-line graph drawings: A first look at edge crossing resolution through iterative vertex splitting.
Henry EhlersAnaïs VilledieuRenata G. RaidouHsiang-Yun WuPublished in: Comput. Graph. (2023)
Keyphrases
- straight line
- undirected graph
- line drawings
- vertex set
- edge weights
- weighted graph
- hough transform
- directed graph
- minimum weight
- strongly connected
- line detection
- disjoint paths
- connected components
- line segments
- intersection points
- graph structure
- shortest path
- spanning tree
- vanishing points
- bipartite graph
- hamiltonian cycle
- labeled graphs
- radon transform
- approximation algorithms
- high resolution
- directed acyclic graph
- complex networks
- random walk
- feature points
- dynamic graph
- maximum cardinality
- attributed graphs
- minimum cost
- edge detection
- betweenness centrality
- decision trees
- image processing