Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions

Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
January 2015
PDF bib DOI

Abstract

Full Citation:

Martin Nöllenburg, Roman Prutkin, Ignaz Rutter. Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. Algorithms and Computation (ISAAC'15) (Khaled Elbassioni, Kazuhisa Makino, eds.), volume 9472 of LNCS, pages 637–649, 2015, Springer Berlin Heidelberg.

Type
Conference Paper
Martin Nöllenburg
Martin Nöllenburg

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