Drawing graphs with vertices at specified positions and crossings at large angles

Fink, M; Haunert, J-H; Mchedlidze, T; Spoerhase, J; Wolff, A

dc.contributor.author	Fink, M	en
dc.contributor.author	Haunert, J-H	en
dc.contributor.author	Mchedlidze, T	en
dc.contributor.author	Spoerhase, J	en
dc.contributor.author	Wolff, A	en
dc.date.accessioned	2014-03-01T02:47:31Z
dc.date.available	2014-03-01T02:47:31Z
dc.date.issued	2012	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33197
dc.subject.other	Drawing styles	en
dc.subject.other	Embeddings	en
dc.subject.other	Graph drawing	en
dc.subject.other	Drawing (graphics)	en
dc.subject.other	Algorithms	en
dc.title	Drawing graphs with vertices at specified positions and crossings at large angles	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-642-28076-4_19	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-642-28076-4_19	en
heal.publicationDate	2012	en
heal.abstract	In point-set-embeddability (PSE) problems one is given not just a graph that is to be drawn, but also a set of points in the plane that specify where the vertices of the graph can be placed. The problem class was introduced by Gritzmann et al. [3] twenty years ago. In their work and most other works on PSE problems, however, planarity of the output drawing was an essential requirement. Recent experiments on the readability of drawings [4] showed that polyline drawings with angles at edge crossings close to 90°. and a small number of bends per edge are just as readable as planar drawings. Motivated by these findings, Didimo et al. [2] recently introduced RAC drawings where pairs of crossing edges must form a right angle and, more generally, αAC drawings (for α∈ (0, 90°]) where the crossing angle must be at least α. As usual, edges may not overlap and may not go through vertices. We investigate the intersection of PSE and RAC/αAC. © 2012 Springer-Verlag Berlin Heidelberg.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-642-28076-4_19	en
dc.identifier.volume	7157 LNCS	en
dc.identifier.spage	186	en
dc.identifier.epage	197	en