Advertisement
Published in:
2014 | OriginalPaper | Chapter
Drawing Simultaneously Embedded Graphs with Few Bends
Authors : Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter
Published in: Graph Drawing
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We study the problem of drawing simultaneously embedded graphs with few bends. We show that for any simultaneous embedding with fixed edges (
Sefe
) of two graphs, there exists a corresponding drawing realizing this embedding such that common edges are drawn as straight-line segments and each exclusive edge has a constant number of bends. If the common graph is biconnected and induced, a straight-line drawing exists. This yields the first efficient testing algorithm for simultaneous geometric embedding (
Sge
) for a non-trivial class of graphs.