88
Voted
GD
2008
Springer
15 years 5 hour 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...
57
Voted
GD
2008
Springer
15 years 5 hour ago
2008
Springer
92
Voted
GD
2008
Springer
15 years 5 hour 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...
77
Voted
GD
2008
Springer
15 years 5 hour 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...