The Straight-Line RAC Drawing Problem is NP-Hard

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Argyriou, E en
dc.contributor.author Bekos, M en
dc.contributor.author Symvonis, A en
dc.date.accessioned 2014-03-01T01:59:34Z
dc.date.available 2014-03-01T01:59:34Z
dc.date.issued 2010 en
dc.identifier.uri http://hdl.handle.net/123456789/28979
dc.relation.uri http://arxiv.org/abs/1009.5227 en
dc.relation.uri http://www.informatik.uni-trier.de/~ley/db/journals/corr/corr1009.html#abs-1009-5227 en
dc.subject Graph Drawing en
dc.title The Straight-Line RAC Drawing Problem is NP-Hard en
heal.type journalArticle en
heal.publicationDate 2010 en
heal.abstract Recent cognitive experiments have shown that the negative impact of an edgecrossing on the human understanding of a graph drawing, tends to be eliminatedin the case where the crossing angles are greater than 70 degrees. Thismotivated the study of RAC drawings, in which every pair of crossing edgesintersects at right angle. In this work, we demonstrate en
heal.journalName Computing Research Repository en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record