Nearly Optimal Visibility Representations of Plane Graphs

DOI10.1007/11786986_36MaRDI QIDQ5901485zbMATH OpenOpenAlexFDO

Authors Xin He, Huaming Zhang

Publication date 12 March 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11786986_36

Mathematics Subject Classification ID

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

Recommendations

• Nearly Optimal Visibility Representations of Plane Graphs
• Compact visibility representation of plane graphs
• Visibility representation of plane graphs with simultaneous bound for both width and height
• Graph Drawing
• Visibility representation of plane graphs via canonical ordering tree

Cited in

(12)

• Optimal st-orientations for plane triangulations
• Special graph representation and visualization of semantic networks
• On 3D visibility representations of graphs with few crossings per edge
• Compact visibility representation of plane graphs
• Visibility representation of plane graphs with simultaneous bound for both width and height
• On Representation of Planar Graphs by Segments
• Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
• Compact visibility representation of 4-connected plane graphs
• Width-Optimal Visibility Representations of Plane Graphs
• Nearly Optimal Visibility Representations of Plane Graphs
• Improved visibility representation of plane graphs
• Visibility representations of four-connected plane graphs with near optimal heights

This page was built for publication: Nearly Optimal Visibility Representations of Plane Graphs

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