Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles

DOI10.1007/978-3-319-06686-8_26zbMath1407.68373MaRDI QIDQ4981173

Andreas Spillner, Julia Schüler

Publication date: 24 June 2014

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06686-8_26

zbMATH Keywords

geometric graph; polygonal obstacle; crossing-free spanning tree

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C85: Graph algorithms (graph-theoretic aspects)