The Straight-Line RAC Drawing Problem is NP-Hard

Details The Straight-Line RAC Drawing Problem is NP-Hard The Straight-Line RAC Drawing Problem is NP-Hard

2010-09-27

arxiv.org/abs/1009.5227v1

Computer Science

Data Structures and Algorithms

23 pages in total

Scientific paper

Recent cognitive experiments have shown that the negative impact of an edge crossing on the human understanding of a graph drawing, tends to be eliminated in the case where the crossing angles are greater than 70 degrees. This motivated the study of RAC drawings, in which every pair of crossing edges intersects at right angle. In this work, we demonstrate a class of graphs with unique RAC combinatorial embedding and we employ members of this class in order to show that it is NP-hard to decide whether a graph admits a straight-line RAC drawing.

Affiliated with

Also associated with

No associations

Rating

The Straight-Line RAC Drawing Problem is NP-Hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Straight-Line RAC Drawing Problem is NP-Hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Straight-Line RAC Drawing Problem is NP-Hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-518124