28 search results - page 2 / 6 » Simultaneous Embedding of Planar Graphs with Few Bends |
GD
2008
Springer
13 years 6 months 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...
COMGEO
2007
ACM
13 years 4 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the ...
GD
2009
Springer
13 years 9 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
COMGEO
2011
ACM
12 years 12 months ago
2011
ACM
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...