AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING

DOI10.1142/S0129054106004303MaRDI QIDQ5493898zbMATH OpenOpenAlexFDO

Authors Huaming Zhang, Xin He

Publication date 16 October 2006

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054106004303

zbMATH Keywords

plane graphplane triangulationvisibility representationwell orderly tree

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Graph Drawing
• Canonical ordering trees and their applications in graph drawing
• Orderly spanning trees with applications to graph encoding and graph drawing
• Width-Optimal Visibility Representations of Plane Graphs
• Orderly Spanning Trees with Applications

Cites work

• A unified approach to visibility representations of planar graphs
• An Optimal Algorithm for the Maximum-Density Segment Problem
• Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation
• Canonical ordering trees and their applications in graph drawing
• Compact floor-planning via orderly spanning trees
• Drawing graphs. Methods and models
• Drawing planar graphs using the canonical ordering
• How to draw a planar graph on a grid
• Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
• Improved visibility representation of plane graphs
• Planar graphs and poset dimension
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• Visibility representation of plane graphs via canonical ordering tree

Cited in

(9)

• Strictly-upward drawings of ordered search trees
• Planar polyline drawings via graph transformations
• Drawing Ordered (k − 1)–Ary Trees on k–Grids
• scientific article; zbMATH DE number 1974132 (Why is no real title available?)
• Width-Optimal Visibility Representations of Plane Graphs
• Graph Drawing
• Visibility drawings of plane 3-trees with minimum area
• Visibility representations of four-connected plane graphs with near optimal heights
• Good spanning trees in graph drawing

This page was built for publication: AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING

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