Evaluating stereo and motion cues for visualizing information nets in three dimensions
ACM Transactions on Graphics (TOG)
Three-Dimensional VLSI: a case study
Journal of the ACM (JACM)
ACM Transactions on Computer-Human Interaction (TOCHI)
Three-dimensional orthogonal graph drawing algorithms
Discrete Applied Mathematics
A Split&Push Approach to 3D Orthogonal Drawing
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Optimal three-dimensional orthogonal graph drawing in the general position model
Theoretical Computer Science
Using Augmented Reality for Visualizing Complex Graphs in Three Dimensions
ISMAR '03 Proceedings of the 2nd IEEE/ACM International Symposium on Mixed and Augmented Reality
Reevaluating stereo and motion cues for visualizing graphs in three dimensions
APGV '05 Proceedings of the 2nd symposium on Applied perception in graphics and visualization
Visualizing graphs in three dimensions
ACM Transactions on Applied Perception (TAP)
An Overview of 3D Software Visualization
IEEE Transactions on Visualization and Computer Graphics
Exploring Semantic Social Networks Using Virtual Reality
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
The effect of stereoscopy and motion cues on 3D interpretation task performance
Proceedings of the International Conference on Advanced Visual Interfaces
Multiscale visualization of small world networks
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
| Hi-index | 0.00 |
3D drawing problems of the 90's were essentially restricted on representations in 3D perspective. However, recent technologies offer 3D stereoscopic representations of high quality which allow the introduction of binocular disparities, which is one of the main depth perception cues, not provided by the 3D perspective. This paper explores the relevance of stereoscopy for the visual identification of communities, which is a task of great importance in the analysis of social networks. A user study conducted on 35 participants with graphs of various complexity shows that stereoscopy outperforms 3D perspective in the vast majority of the cases. When comparing stereoscopy with 2D layouts, the response time is significantly lower for 2D but the quality of the results closely depend on the graph complexity: for a large number of clusters and a high probability of cluster overlapping stereoscopy outperforms 2D whereas for simple structures 2D layouts are more efficient.