Viewpoint Optimization for 3D Graph Drawings

Abstract 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.

Authors

Institutions

Publication Details

Journal
Computer Graphics Forum
Published
2025-05-23
DOI
https://doi.org/10.1111/cgf.70127
Primary Topic
Computer Graphics and Visualization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Viewpoint Optimization for 3D Graph Drawings

Alexandru Telea, Tamara Mchedlidze, Simon van Wageningen
Computer Graphics Forum
Computer Graphics and Visualization Techniques
article

Viewpoint Optimization for 3D Graph Drawings

Alexandru Telea, Tamara Mchedlidze, Simon van Wageningen
article en

Abstract

Abstract 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.

Computer Graphics ForumVol. 44(3)
Utrecht University (NL)
Openalex Percentile: Top 80%
Computer Graphics and Visualization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.