Improved visibility representation of plane graphs

DOI10.1016/j.comgeo.2004.08.002zbMath1059.05079OpenAlexW2010475327MaRDI QIDQ706721

Xin He, Huaming Zhang

Publication date: 9 February 2005

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.08.002

zbMATH Keywords

graphvisibility representation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (9)

Visibility representations of four-connected plane graphs with near optimal heights ⋮ Skyscraper polytopes and realizations of plane triangulations ⋮ Good spanning trees in graph drawing ⋮ Compact visibility representation of 4-connected plane graphs ⋮ Width-Optimal Visibility Representations of Plane Graphs ⋮ Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights ⋮ Algorithms for Drawing Planar p-petal Graphs ⋮ AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING ⋮ Visibility representation of plane graphs via canonical ordering tree

Cites Work

• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Planar graphs and poset dimension
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• STACS 2004
• Graph Drawing
• Algorithms and Data Structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved visibility representation of plane graphs