7465 search results - page 1113 / 1493 » Point-based Computer graphics |
176
click to vote
DAGM
2004
Springer
16 years 6 days ago
2004
Springer
We present an approach to discretizing multivariate continuous data while learning the structure of a graphical model. We derive the joint scoring function from the principle of p...
175
click to vote
GD
2004
Springer
16 years 6 days ago
2004
Springer
We propose a method for drawing AS graph data using 2.5D graph visualization. In order to bring out the pure graph structure of the AS graph we consider its core hierarchy. The k-c...
153
click to vote
GD
2004
Springer
16 years 6 days ago
2004
Springer
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, a...
189
click to vote
GD
2004
Springer
16 years 6 days ago
2004
Springer
This paper discusses a new method for visualisation of large and complex networks in three dimensions. In particular, we focus on visualising the core tree structure of the large a...
178
click to vote
GD
2004
Springer
16 years 6 days ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...