Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
From MaRDI portal
Publication:4540529
DOI10.7155/jgaa.00046zbMath0999.68164OpenAlexW2099520181MaRDI QIDQ4540529
Michael Kaufmann, Roland Wiese
Publication date: 25 July 2002
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/49574
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (47)
A new algorithm for embedding plane graphs at fixed vertex locations ⋮ SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES ⋮ On triconnected and cubic plane graphs on given point sets ⋮ Untangling two systems of noncrossing curves ⋮ Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices ⋮ Upward Straight-Line Embeddings of Directed Graphs into Point Sets ⋮ Quasi-upward planar drawings with minimum curve complexity ⋮ Orthogeodesic point-set embedding of trees ⋮ Optimal point-set embedding of wheel graphs and a sub-class of 3-trees ⋮ Embedding Plane 3-Trees in ℝ2 and ℝ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 ⋮ On embedding triconnected cubic graphs on point sets ⋮ Non-aligned Drawings of Planar Graphs ⋮ Arc diagrams, flip distances, and Hamiltonian triangulations ⋮ Point-set embeddings of plane \(3\)-trees ⋮ On upward point set embeddability ⋮ Colored anchored visibility representations in 2D and 3D space ⋮ On the curve complexity of 3-colored point-set embeddings ⋮ Point-set embeddings of trees with given partial drawings ⋮ Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges ⋮ Colored Point-Set Embeddings of Acyclic Graphs ⋮ Computing Upward Topological Book Embeddings of Upward Planar Digraphs ⋮ Small universal point sets for \(k\)-outerplanar graphs ⋮ Radial drawings of graphs: geometric constraints and trade-offs ⋮ Drawing colored graphs on colored points ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ Simultaneous Embeddings with Few Bends and Crossings ⋮ Drawing colored graphs with constrained vertex positions and few bends per edge ⋮ Curve-constrained drawings of planar graphs ⋮ \(k\)-spine, 1-bend planarity ⋮ CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS ⋮ Constrained Point-Set Embeddability of Planar Graphs ⋮ SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ Planar straight-line point-set embedding of trees with partial embeddings ⋮ Upward straight-line embeddings of directed graphs into point sets ⋮ ON EMBEDDING A GRAPH ON TWO SETS OF POINTS ⋮ Untangling a planar graph ⋮ Planar drawings of fixed-mobile bigraphs ⋮ Right Angle Crossing Drawings of Graphs ⋮ A Census of Plane Graphs with Polyline Edges ⋮ Plane 3-Trees: Embeddability and Approximation ⋮ Constrained Point Set Embedding of a Balanced Binary Tree ⋮ THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
This page was built for publication: Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
