,

One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons

, , , , и .
Proceedings of the 36th European Workshop on Computational Geometry (EuroCG'20), стр. 70:1--70:6. Würzburg, (2020)Abstract.

Аннотация

We consider the problem of drawing an outerplanar graph with n vertices with at most one bend per edge if the outer face is already drawn as a simple polygon with m corners. We prove that it can be decided in O(mn) time if such a drawing exists. In the positive case, our algorithm also outputs such a drawing.

тэги

Пользователи данного ресурса

  • @kindermann
  • @andreloe

Комментарии и рецензии