Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions

Abstract

Full Citation:

Nöllenburg, Martin, Prutkin, Roman, Rutter, Ignaz. Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. International Journal of Computational Geometry and Applications, volume 27, number 1–2, pages 121-158, 2017.

Martin Nöllenburg

Martin Nöllenburg is a Professor at the Algorithms and Complexity Group.