One-bend drawings of outerplanar graphs inside simple polygons

DOI10.1007/978-3-030-92931-2_13OpenAlexW3196852880MaRDI QIDQ2151442

Philipp Kindermann, Andre Löffler, Lena Schlipf, Patrizio Angelini, Antonios Symvonis

Publication date: 1 July 2022

Full work available at URL: https://arxiv.org/abs/2108.12321

zbMATH Keywords

outerplanar graphsvisibility graphsimple polygonpartial embedding

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Extending convex partial drawings of graphs
• VC-dimension of perimeter visibility domains
• How to draw a planar graph on a grid
• Convex drawings of graphs with non-convex boundary constraints
• The complexity of drawing a graph in a polygonal region
• \(\beta\)-stars or on extending a drawing of a connected subgraph
• A Kuratowski-type theorem for planarity of partially embedded graphs
• Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
• Testing Planarity of Partially Embedded Graphs
• EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING
• ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
• How to Draw a Graph
• Graph Drawing
• Drawing Partially Embedded and Simultaneously Planar Graphs
• Embedding planar graphs at fixed vertex locations

This page was built for publication: One-bend drawings of outerplanar graphs inside simple polygons