Embedding Vertices at Points: Few Bends Suffice for Planar Graphs

Recommendations

scientific article; zbMATH DE number 1500681
On point set embeddings for \(k\)-planar graphs with few bends per edge
Graph Drawing
Simultaneous Embedding of Planar Graphs with Few Bends
Embedding planar graphs at fixed vertex locations
Constrained Point-Set Embeddability of Planar Graphs
Constrained point-set embeddability of planar graphs
On Embedding a Graph in the Grid with the Minimum Number of Bends
Graph Drawing
Planar Embeddings of Graphs with Specified Edge Lengths

Cited in

(53)

Constrained point set embedding of a balanced binary tree
Radial drawings of graphs: geometric constraints and trade-offs
Upward Straight-Line Embeddings of Directed Graphs into Point Sets
Computing Upward Topological Book Embeddings of Upward Planar Digraphs
Colored Point-Set Embeddings of Acyclic Graphs
Right Angle Crossing Drawings of Graphs
Moving Vertices to Make Drawings Plane
SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
SEFE without mapping via large induced outerplane graphs in plane graphs
Improved bounds for drawing trees on fixed points with L-shaped edges
Upward straight-line embeddings of directed graphs into point sets
Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
2-colored point-set embeddings of partial 2-trees
Point-set embeddings of plane 3-trees
Orthogeodesic point-set embedding of trees
A new algorithm for embedding plane graphs at fixed vertex locations
Non-aligned drawings of planar graphs
Upward point set embeddability for convex point sets is in P
Constrained point-set embeddability of planar graphs
Small universal point sets for \(k\)-outerplanar graphs
A Census of Plane Graphs with Polyline Edges
On upward point set embeddability
Computing upward topological book embeddings of upward planar digraphs
Simultaneous Embedding of Planar Graphs with Few Bends
On point-sets that support planar graphs
2-colored point-set embeddings of partial 2-trees
Untangling a planar graph
Quasi-upward planar drawings with minimum curve complexity
On the curve complexity of 3-colored point-set embeddings
Embedding plane 3-trees in \(\mathbb R^{2}\) and \(\mathbb R^{3}\)
On embedding a graph in the grid with the maximum number of bends and other bad features
Planar straight-line point-set embedding of trees with partial embeddings
\(k\)-spine, 1-bend planarity
Optimal point-set embedding of wheel graphs and a sub-class of 3-trees
Orthogeodesic point-set embedding of trees
An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid
ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
Embedding planar graphs at fixed vertex locations
Constrained Point-Set Embeddability of Planar Graphs
The point-set embeddability problem for plane graphs
Curve-constrained drawings of planar graphs
Point-set embeddings of trees with given partial drawings
Simultaneous embeddings with few bends and crossings
Theoretical results on at most 1-bend embeddability of graphs
Drawing colored graphs on colored points
Drawing colored graphs with constrained vertex positions and few bends per edge
On triconnected and cubic plane graphs on given point sets
Arc diagrams, flip distances, and Hamiltonian triangulations
An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid
On embedding triconnected cubic graphs on point sets
Plane 3-trees: embeddability and approximation
Colored anchored visibility representations in 2D and 3D space
On 1-bend upward point-set embeddings of \(st\)-digraphs

This page was built for publication: Embedding Vertices at Points: Few Bends Suffice for Planar Graphs

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