Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions

Nöllenburg, Martin; Prutkin, Roman; Rutter, Ignaz

doi:10.1007/978-3-662-48971-0_54

by Martin Nöllenburg, Roman Prutkin, Ignaz Rutter

Reference:

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

Bibtex Entry:

@inproceedings{npr-pgdtspigrr-15,
	Author = {Nöllenburg, Martin and Prutkin, Roman and Rutter, Ignaz},
	Booktitle = {Algorithms and Computation (ISAAC'15)},
	Doi = {10.1007/978-3-662-48971-0_54},
	Editor = {Elbassioni, Khaled and Makino, Kazuhisa},
	Ee = {1509.05635},
	Pages = {637--649},
	Publisher = {Springer Berlin Heidelberg},
	Series = {LNCS},
	Title = {Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions},
	Url = {http://arxiv.org/abs/1509.05635},
	Volume = {9472},
	Year = {2015},
	
	}