Testing Simultaneous Planarity when the Common Graph is 2-Connected

Details Testing Simultaneous Planarity when the Common Graph is 2-Connected Testing Simultaneous Planarity when the Common Graph is 2-Connected

2010-09-23

arxiv.org/abs/1009.4517v2

Computer Science

Data Structures and Algorithms

Appeared in ISAAC 2010, 15 pages, 3 figures

Scientific paper

Two planar graphs G1 and G2 sharing some vertices and edges are `simultaneously planar' if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings. It is an open problem whether simultaneous planarity can be tested efficiently. We give a linear-time algorithm to test simultaneous planarity when the two graphs share a 2-connected subgraph. Our algorithm extends to the case of k planar graphs where each vertex [edge] is either common to all graphs or belongs to exactly one of them.

Affiliated with

Also associated with

No associations

Rating

Testing Simultaneous Planarity when the Common Graph is 2-Connected does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Testing Simultaneous Planarity when the Common Graph is 2-Connected, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Testing Simultaneous Planarity when the Common Graph is 2-Connected will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-338229