Visibility representations of four-connected plane graphs with near optimal heights

DOI10.1016/j.comgeo.2009.01.006zbMath1200.05142OpenAlexW1987559104MaRDI QIDQ833713

Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu

Publication date: 14 August 2009

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

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

zbMATH Keywords

planar graphgraph drawingladder graphvisibility representation\(s\)t-orderingcanonical ordering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Improved visibility representation of plane graphs
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Computing an st-numbering
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• Canonical ordering trees and their applications in graph drawing
• Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
• Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
• STACS 2004
• Width-Optimal Visibility Representations of Plane Graphs
• Optimal st-Orientations for Plane Triangulations
• AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
• Graph Drawing
• Graph Drawing
• Algorithms and Data Structures
• Nearly Optimal Visibility Representations of Plane Graphs
• Nearly Optimal Visibility Representations of Plane Graphs