Canonical ordering trees and their applications in graph drawing

DOI10.1007/s00454-004-1154-yzbMath1058.05049OpenAlexW2080046276MaRDI QIDQ1772134

Xin He, Huaming Zhang

Publication date: 15 April 2005

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-004-1154-y

zbMATH Keywords

plane triangulationvisibility representationedge labelingdrawingsminimum realizer

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (10)

Drawing plane triangulations with few segments ⋮ Visibility representations of four-connected plane graphs with near optimal heights ⋮ On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs ⋮ Drawing Planar Graphs with Few Geometric Primitives ⋮ Acyclic coloring with few division vertices ⋮ Bounds for the oriented diameter of planar triangulations ⋮ Compact visibility representation of 4-connected plane graphs ⋮ Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights ⋮ ON OPEN RECTANGLE-OF-INFLUENCE AND RECTANGULAR DUAL DRAWINGS OF PLANE GRAPHS ⋮ AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING

This page was built for publication: Canonical ordering trees and their applications in graph drawing