Computing β-Drawings of 2-Outerplane Graphs in Linear Time

DOI10.1007/978-3-540-77891-2_8zbMath1132.68798OpenAlexW1572516895MaRDI QIDQ5452155

M.D. Abul Hassan Samee, Mohammad T. Irfan, Md. Saidur Rahman

Publication date: 25 March 2008

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77891-2_8

zbMATH Keywords

Graph Drawing\(\beta \)-Drawing2-Outerplane graphGood Slicing PathProximity DrawingProximity GraphSlicing Path

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Polynomial area bounds for MST embeddings of trees ⋮ The approximate rectangle of influence drawability problem

Cites Work

• Unnamed Item
• Characterizing proximity trees

This page was built for publication: Computing β-Drawings of 2-Outerplane Graphs in Linear Time