140 search results - page 2 / 28 » On simultaneous planar graph embeddings |
GD
2007
Springer
14 years 4 months ago
2007
Springer
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
COMGEO
2011
ACM
13 years 4 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 ...
GD
2004
Springer
14 years 3 months ago
2004
Springer
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...
DCG
2010
13 years 10 months ago
2010
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this...
GD
2007
Springer
14 years 4 months ago
2007
Springer
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...