Extending convex partial drawings of graphs
DOI10.1007/S00453-015-0018-6zbMATH Open1348.68176OpenAlexW917784916MaRDI QIDQ334920FDOQ334920
Authors: Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter
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
Recommendations
linear-time algorithmconvex shapeextension of a partial drawingfixed cyclefixed inner facestraight-line drawing
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Generating rooted triangulations without repetitions
- How to Draw a Graph
- 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
- Testing planarity of partially embedded graphs
- ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
- 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
- Convex drawings of graphs with non-convex boundary constraints
Cited In (20)
- \(\beta\)-stars or on extending a drawing of a connected subgraph
- The complexity of drawing a graph in a polygonal region
- Title not available (Why is that?)
- Level-planar drawings with few slopes
- Title not available (Why is that?)
- Beyond Clustered Planar Graphs
- Extending partial orthogonal drawings
- How to draw a planarization
- On-line convex planarity testing
- One-bend drawings of outerplanar graphs inside simple polygons
- Extending orthogonal planar graph drawings is fixed-parameter tractable
- The complexity of drawing a graph in a polygonal region
- Graph Drawing
- Level-planar drawings with few slopes
- Inserting one edge into a simple drawing is hard
- ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
- Incremental convex planarity testing
- Drawing planar graphs with a prescribed inner face
- Testing planarity of partially embedded graphs
- Extending simple drawings
This page was built for publication: Extending convex partial drawings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334920)