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

(58)

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

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)