7405 search results - page 1281 / 1481 » Computer Graphics |
114
click to vote
GD
2004
Springer
15 years 7 months ago
2004
Springer
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
76
Voted
GD
2004
Springer
15 years 7 months ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
101
click to vote
GD
2004
Springer
15 years 7 months ago
2004
Springer
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...
113
click to vote
GD
2004
Springer
15 years 7 months ago
2004
Springer
We study 3-dimensional layouts of the hypercube in a 1-active layer and general model. The problem can be understood as a graph drawing problem in 3D space and was addressed at Gr...
102
Voted
MATA
2004
Springer
15 years 7 months ago
2004
Springer
Although inexpensive, high performance computer graphics hardware has become commonly available, its application in the mobile agent and networking fields has thus far been limite...