\(\beta\)-stars or on extending a drawing of a connected subgraph
From MaRDI portal
Publication:1725776
DOI10.1007/978-3-030-04414-5_30OpenAlexW2889556723MaRDI QIDQ1725776
Tamara Mchedlidze, Jérôme Urhausen
Publication date: 15 February 2019
Full work available at URL: https://arxiv.org/abs/1808.10366
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
One-bend drawings of outerplanar graphs inside simple polygons, \(\beta\)-stars or on extending a drawing of a connected subgraph
Cites Work
- Extending convex partial drawings of graphs
- Point-set embeddings of trees with given partial drawings
- Convex drawings of graphs with non-convex boundary constraints
- Drawing colored graphs on colored points
- Untangling a planar graph
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
- The complexity of drawing a graph in a polygonal region
- \(\beta\)-stars or on extending a drawing of a connected subgraph
- Drawing planar graphs using the canonical ordering
- Planar drawings of fixed-mobile bigraphs
- 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
- Embedding planar graphs at fixed vertex locations
