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

Authors:
Cesim Erten;Stephen G. Kobourov
Affiliations:
Department of Computer Science, University of Arizona, Tucson, AZ 85721, USA;Department of Computer Science, University of Arizona, Tucson, AZ 85721, USA
Venue:
Theory of Computing Systems
Year:
2005

Citing 0
Cited 4

On simultaneous straight-line grid embedding of a planar graph and its dual

Information Processing Letters
Visual Analysis of One-to-Many Matched Graphs

Graph Drawing
ACO for Solving the Distributed Allocation of a Corporate Semantic Web

MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Simultaneous graph embeddings with fixed edges

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional representations of graphs and their duals suggest that the dual vertices should be placed inside their corresponding primal faces, and the edges of the dual graph should only cross their corresponding primal edges. We consider the problem of simultaneously embedding a planar graph and its dual on a small integer grid such that the edges are drawn as straight-line segments and the only crossings are between primal--dual pairs of edges. We provide an O(n) time algorithm that simultaneously embeds a 3-connected planar graph and its dual on a (2n - 2) 脳 (2n - 2) integer grid, where n is the total number of vertices in the graph and its dual. All the edges are drawn as straight-line segments except for one edge on the outer face, which is drawn using two segments.