Algorithms for Drawing Planar p-petal Graphs
From MaRDI portal
Publication:2831832
DOI10.1080/09720529.2014.932132zbMath1348.05139OpenAlexW1991519820MaRDI QIDQ2831832
Publication date: 3 November 2016
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2014.932132
Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Improved visibility representation of plane graphs
- A linear algorithm for embedding planar graphs using PQ-trees
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Drawing planar graphs using the canonical ordering
- A new planarity test
- Convex Representations of Graphs
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Efficient Planarity Testing
- Spirality and Optimal Orthogonal Drawings
- Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
- Rectangular drawings of plane graphs without designated corners