1997
DOI: 10.1007/3-540-63938-1_53
|View full text |Cite
|
Sign up to set email alerts
|

Finding the best viewpoints for three-dimensional graph drawings

Abstract: Abstract. In this paper we address the problem of finding the best viewpoints for three-dimensional straight-line graph drawings. We define goodness in terms of preserving the relational structure of the graph, and develop two continuous measures of goodness under orthographic parallel projection. We develop Voronoi variants to find the best viewpoints under these measures, and present results on the complexity of these diagrams.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

1998
1998
2017
2017

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 21 publications
(21 citation statements)
references
References 17 publications
0
21
0
Order By: Relevance
“…So the scene watch the ball created in the system, make its objects, surrounded by projection sphere radius size of stadia, set a certain number of points on a sphere, represent different viewpoints, point to the direction of its coordinates for the projection direction. In the second, literature [10,11] based on point location of 3d scene observation, there made improvements, sphere radius can be changed in the practical application, spherical coordinate points can pick up means point location, the projection direction can change, people can get different projection effect, greatly enhance the experimental efficiency and user interactivity.…”
Section: Technical Solutionmentioning
confidence: 99%
“…So the scene watch the ball created in the system, make its objects, surrounded by projection sphere radius size of stadia, set a certain number of points on a sphere, represent different viewpoints, point to the direction of its coordinates for the projection direction. In the second, literature [10,11] based on point location of 3d scene observation, there made improvements, sphere radius can be changed in the practical application, spherical coordinate points can pick up means point location, the projection direction can change, people can get different projection effect, greatly enhance the experimental efficiency and user interactivity.…”
Section: Technical Solutionmentioning
confidence: 99%
“…This becomes apparent when the number of connections is so high that visualizing the network as a graph leads to confusing "spaghetti-like" clusters that are so dense as to not be amendable to interpretation [6]. Furthermore, while algorithms like Kamada-Kawai can be extended to three dimensions, the problem of determining where precisely a user should be placed in the 3-D visualization remains an open area of research [8]. Placing the user's view point "in the middle" of a three-dimensional visualization may hinder rather than help the visualization process, since the viewpoint may hide parts of the network.…”
Section: Network Layoutmentioning
confidence: 99%
“…An exact algorithm that requires a preprocessing time of Ω((|V |+|E|) 4 log(|V |+|E|)) was suggested in [6]. Iterative heuristic algorithms, with a faster running time (but still, at least O(|V | · |E|)), were suggested in [13].…”
Section: Finding the Best Viewpoint For 3-d Layoutsmentioning
confidence: 99%