L-shaped point set embeddings of high-degree plane graphs
From MaRDI portal
Publication:5154585
Recommendations
- On L-shaped point set embeddings of trees: first non-embeddable examples
- On L-shaped point set embeddings of trees: first non-embeddable examples
- Orthogeodesic point-set embedding of trees
- Point-set embeddings of plane 3-trees (extended abstract)
- Improved bounds for drawing trees on fixed points with L-shaped edges
Cites work
- scientific article; zbMATH DE number 2123122 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- Geometric graphs in the plane lattice
- Graph Drawing
- Lower bounds for planar orthogonal drawings of graphs
- On embedding an outer-planar graph in a point set
- Optimal Algorithms to Embed Trees in a Point Set
- Orthogeodesic point-set embedding of trees
- Orthogonal Drawings of Plane Graphs Without Bends
Cited in
(4)
This page was built for publication: \(L\)-shaped point set embeddings of high-degree plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154585)