Non-crossing geometric Steiner arborescences

DOI10.4230/LIPICS.ISAAC.2017.54zbMATH Open1457.68293OpenAlexW2783858917MaRDI QIDQ5136274FDOQ5136274

Authors: Irina Kostitsyna, Bettina Speckmann, Kevin Verbeek 

Publication date: 25 November 2020

Full work available at URL: https://doi.org/10.4230/lipics.isaac.2017.54

Recommendations

• Angle-restricted Steiner arborescences for flow map layout
• Angle-Restricted Steiner Arborescences for Flow Map Layout
• Finding a noncrossing Steiner forest in plane graphs under a 2-face condition
• scientific article; zbMATH DE number 1522940
• Simultaneous Geometric Graph Embeddings

zbMATH Keywords

rectilinearSteiner arborescencesangle-restrictednon-crossing drawing

Mathematics Subject Classification ID

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

Cites Work

• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• The complexity of detecting crossingfree configurations in the plane
• Polynomial time approximation scheme for the rectilinear Steiner arborescence problem
• Intersection number of two connected geometric graphs
• Combinatorial Geometry and Graph Theory
• Generalized self-approaching curves
• On plane spanning trees and cycles of multicolored point sets with few intersections
• Connecting colored point sets
• Configurations with few crossings in topological graphs
• Colored Non-crossing Euclidean Steiner Forest
• Angle-restricted Steiner arborescences for flow map layout
• Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles

Cited In (2)

• Angle-restricted Steiner arborescences for flow map layout
• Colored Non-crossing Euclidean Steiner Forest

This page was built for publication: Non-crossing geometric Steiner arborescences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136274)