Manhattan-Geodesic Embedding of Planar Graphs

DOI10.1007/978-3-642-11805-0_21zbMath1284.68466OpenAlexW1605660236MaRDI QIDQ3557879

Ignaz Rutter, Bastian Katz, Alexander Wolff, Marcus Krug

Publication date: 27 April 2010

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11805-0_21

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Multi-sided boundary labeling ⋮ Orthogeodesic point-set embedding of trees ⋮ Optimal point-set embedding of wheel graphs and a sub-class of 3-trees ⋮ Grid obstacle representation of graphs ⋮ Bend-optimal orthogonal graph drawing in the general position model ⋮ Orthogeodesic Point-Set Embedding of Trees ⋮ Hamiltonian orthogeodesic alternating paths ⋮ Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges ⋮ Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity ⋮ Non-crossing Paths with Geographic Constraints ⋮ On L-shaped point set embeddings of trees: first non-embeddable examples ⋮ Geometric Graphs in the Plane Lattice ⋮ Plane 3-Trees: Embeddability and Approximation ⋮ On L-shaped point set embeddings of trees: first non-embeddable examples