Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
From MaRDI portal
Publication:3459901
DOI10.1007/978-3-662-48971-0_54zbMath1372.68269arXiv1509.05635OpenAlexW2949922598MaRDI QIDQ3459901
Ignaz Rutter, Roman Prutkin, Martin Nöllenburg
Publication date: 11 January 2016
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.05635
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
This page was built for publication: Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
