.png){kind=icon}
.png){kind=icon}
Return
Viewpoint Optimization for 3D Graph Drawings
.png){kind=icon}
OA
AI
DOI：10.1111/cgf.70127.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph drawings using a node-link metaphor and straight edges are widely used to represent and understand relational data. While such drawings are typically created in 2D, 3D representations have also gained popularity. When exploring 3D drawings, finding viewpoints that help understanding the graph's structure is crucial. Finding good viewpoints also allows using the 3D drawings to generate good 2D graph drawings. In this work, we tackle the problem of automatically finding high-quality viewpoints for 3D graph drawings. We propose and evaluate strategies based on sampling, gradient descent, and evolutionary-inspired meta-heuristics. Our results show that most strategies quickly converge to high-quality viewpoints within a few dozen function evaluations, with meta-heuristic approaches showing robust performance regardless of the quality metric.
Keywords:
STRESS
FRAMEWORK
ALGORITHM
LAYOUTS
Journal
IF:
2.9
Papers:
496
Citations:
1.1W