An SPQRTreeLike Embedding Representation for Level Planarity
Abstract
An SPQRtree is a data structure that efficiently represents all planar embeddings of a biconnected planar graph. It is a key tool in a number of constrained planarity testing algorithms, which seek a planar embedding of a graph subject to some given set of constraints. We develop an SPQRtreelike data structure that represents all levelplanar embeddings of a biconnected level graph with a single source, called the LPtree, and give a simple algorithm to compute it in linear time. Moreover, we show that LPtrees can be used to adapt three constrained planarity algorithms to the levelplanar case by using them as a dropin replacement for SPQRtrees.
 Publication:

arXiv eprints
 Pub Date:
 September 2020
 arXiv:
 arXiv:2009.12309
 Bibcode:
 2020arXiv200912309B
 Keywords:

 Computer Science  Data Structures and Algorithms