Manhattan-geodesic embedding of planar graphs

DOI10.1007/978-3-642-11805-0_21MaRDI QIDQ3557879zbMATH OpenOpenAlexFDO

Authors Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander Wolff

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

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

Recommendations

• Constrained point-set embeddability of planar graphs
• Constrained Point-Set Embeddability of Planar Graphs
• Orthogeodesic point-set embedding of trees
• Point-Set Embedding of Trees with Edge Constraints
• Orthogeodesic point-set embedding of trees

Cited in

(15)

• Geodesic embeddings and planar graphs
• Manhattan property of geodesic paths on self-affine carpets
• On L-shaped point set embeddings of trees: first non-embeddable examples
• Hamiltonian orthogeodesic alternating paths
• 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
• Orthogeodesic point-set embedding of trees
• Multi-sided boundary labeling
• Bend-optimal orthogonal graph drawing in the general position model
• Improved bounds for drawing trees on fixed points with L-shaped edges
• Geometric graphs in the plane lattice
• On L-shaped point set embeddings of trees: first non-embeddable examples
• Plane 3-trees: embeddability and approximation
• Linear-size planar Manhattan network for convex point sets

This page was built for publication: Manhattan-geodesic embedding of planar graphs

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