Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

GD
2004
Springer

favoriteEmaildiscussreport

97views Computer Graphics» more GD 2004»

Simultaneous Embedding of Planar Graphs with Few Bends

13 years 9 months ago

Simultaneous Embedding of Planar Graphs with Few Bends

Download www.cs.arizona.edu

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 vertices. For the case when the input graphs are are both trees, only one bend per edge is required. We also describe an O(n) time algorithm for simultaneous embedding with ﬁxed-edges for tree-path pairs on the O(n) × O(n2 ) grid with at most one bend per tree-edge and no bends along path edges.

Cesim Erten, Stephen G. Kobourov

Real-time Traffic

GD 2004 | Planar Graphs | Simultaneous Embedding | Time Algorithm |

claim paper

Related Content

» Simultaneous Graph Embedding with Bends and Circular Arcs

» Universal Sets of n Points for 1Bend Drawings of Planar Graphs with n Vertices

» Universal Sets of n Points for Onebend Drawings of Planar Graphs with n Vertices

» Drawings of planar graphs with few slopes and segments

» An SPQRTree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges

» Graph drawings with few slopes

» Simultaneous Embedding of a Planar Graph and Its Dual on the Grid

» Geometric Simultaneous Embeddings of a Graph and a Matching

» Characterizations of restricted pairs of planar graphs allowing simultaneous embedding wit...

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	GD
Authors	Cesim Erten, Stephen G. Kobourov

Comments (0)