GD
2008
Springer
14 years 21 days ago
2008
Springer
GD
2008
Springer
14 years 21 days ago
2008
Springer
GD
2008
Springer
14 years 21 days ago
2008
Springer
GD
2008
Springer
14 years 21 days ago
2008
Springer
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...
GD
2008
Springer
14 years 21 days ago
2008
Springer
Abstract. We introduce the concept of subdivision drawings of hypergraphs. In a subdivision drawing each vertex corresponds uniquely to a face of a planar subdivision and, for each...
GD
2008
Springer
14 years 21 days ago
2008
Springer
GD
2008
Springer
14 years 21 days ago
2008
Springer
Abstract. As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the...
GD
2008
Springer
14 years 21 days ago
2008
Springer
GD
2008
Springer
14 years 21 days ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
GD
2008
Springer
14 years 21 days ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...