Windrose Planarity

DOI10.1145/3239561zbMath1454.68091OpenAlexW4289389740WikidataQ129227642 ScholiaQ129227642MaRDI QIDQ4629968

Valentino Di Donato, Patrizio Angelini, Günter Rote, Giordano Da Lozzo, Philipp Kindermann, Giuseppe Di Battista, Ignaz Rutter

Publication date: 28 March 2019

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3239561

zbMATH Keywords

algorithmsplanar graphsgraph drawingupward planaritycombinatorial embeddings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (7)

Drawing two posets ⋮ Planar L-Drawings of Bimodal Graphs ⋮ Planar straight-line realizations of 2-trees with prescribed edge lengths ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Extending upward planar graph drawings ⋮ Computing k-modal embeddings of planar digraphs ⋮ Upward Book Embeddings of st-Graphs

This page was built for publication: Windrose Planarity