Extending convex partial drawings of graphs

DOI10.1007/s00453-015-0018-6zbMath1348.68176OpenAlexW917784916MaRDI QIDQ334920

Tamara Mchedlidze, Ignaz Rutter, Martin Nöllenburg

Publication date: 1 November 2016

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-015-0018-6

zbMATH Keywords

linear-time algorithmconvex shapeextension of a partial drawingfixed cyclefixed inner facestraight-line drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (12)

The Complexity of Drawing a Graph in a Polygonal Region ⋮ One-bend drawings of outerplanar graphs inside simple polygons ⋮ Extending simple drawings ⋮ The complexity of drawing a graph in a polygonal region ⋮ \(\beta\)-stars or on extending a drawing of a connected subgraph ⋮ How to Draw a Planarization ⋮ Unnamed Item ⋮ Level-planar drawings with few slopes ⋮ Level-planar drawings with few slopes ⋮ Inserting one edge into a simple drawing is hard ⋮ Planar drawings of fixed-mobile bigraphs ⋮ Beyond Clustered Planar Graphs

Cites Work

• Unnamed Item
• Convex drawings of graphs with non-convex boundary constraints
• Generating rooted triangulations without repetitions
• A Kuratowski-type theorem for planarity of partially embedded graphs
• Drawing Planar Graphs with a Prescribed Inner Face
• The Vertex-Disjoint Menger Problem in Planar Graphs
• ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
• How to Draw a Graph
• Drawing Partially Embedded and Simultaneously Planar Graphs
• Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
• Planar Drawings of Higher-Genus Graphs
• Embedding planar graphs at fixed vertex locations

This page was built for publication: Extending convex partial drawings of graphs