Planar L-Drawings of Bimodal Graphs

DOI10.1007/978-3-030-68766-3_17MaRDI QIDQ5014118zbMATH OpenOpenAlexFDO

Authors Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo

Publication date 1 December 2021

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2008.07834

zbMATH Keywords

bimodalitydirected graphsplanar L-drawings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A linear algorithm to find a rectangular dual of a planar triangulated graph
• A New Approximation Algorithm for Bend Minimization in the Kandinsky Model
• Algorithms and bounds for L-drawings of directed graphs
• Complexity of higher-degree orthogonal graph embedding in the Kandinsky model
• Computing k-modal embeddings of planar digraphs
• scientific article; zbMATH DE number 1974102 (Why is no real title available?)
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On Finding the Rectangular Duals of Planar Triangular Graphs
• On Triangle Contact Graphs
• Planar L-drawings of directed graphs
• Rectangular duals of planar graphs
• The (3,1)-ordering for 4-connected planar triangulations
• Two algorithms for finding rectangular duals of planar graphs
• Upward and quasi-upward planarity testing of embedded mixed graphs

Cited in

(3)

• Quasi-upward planar drawings with minimum curve complexity
• L-Drawings of Directed Graphs
• Planar Lombardi Drawings for Subcubic Graphs

This page was built for publication: Planar L-Drawings of Bimodal Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014118)