Every planar graph has a concentric representation based on a breadth first search, see [21]. The vertices are placed on concentric circles and the edges are routed as curves without crossings. Here we take the opposite view. A graph with a given partitioning of its vertices onto k concentric circles is fc-radial planar, if the edges can be routed monotonie between the circles without crossings. Radial planarity is a generalisation of level planarity, where the vertices are placed on k horizontal lines. We extend the technique for level planarity testing of [18,17,15,16,12,13] and show that radial planarity is decidable in linear time, and that a radial planar embedding can be computed in linear time. © Springer-Verlag 2004.
CITATION STYLE
Bachmaier, C., Brandenburg, F. J., & Forster, M. (2004). Radial level planarity testing and embedding in linear time. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2912, 393–405. https://doi.org/10.1007/978-3-540-24595-7_37
Mendeley helps you to discover research relevant for your work.