Orthogonal drawings based on the stratification of planar graphs

MaRDI QIDQ2816061zbMATH OpenFDO

Authors Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah

Publication date 1 July 2016

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065305801180?np=y

zbMATH Keywords

stratificationorthogonal drawings2-visibilityKandinsky

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Orthogonal drawings based on the stratification of planar graphs
• scientific article; zbMATH DE number 1989701
• An algorithm for straight-line drawing of planar graphs
• A better heuristic for orthogonal graph drawings
• Drawing planar graphs using the canonical ordering

Cited in

(10)

• Smooth Orthogonal Drawings of Planar Graphs
• scientific article; zbMATH DE number 2084273 (Why is no real title available?)
• scientific article; zbMATH DE number 1974108 (Why is no real title available?)
• scientific article; zbMATH DE number 7692360 (Why is no real title available?)
• Computing and Combinatorics
• Orthogonal Drawings of Plane Graphs Without Bends
• Exploring Complex Drawings via Edge Stratification
• Orthogonal Drawings for Plane Graphs with Specified Face Areas
• A New Approximation Algorithm for Bend Minimization in the Kandinsky Model
• Optimal morphs of planar orthogonal drawings. II

This page was built for publication: Orthogonal drawings based on the stratification of planar graphs

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