Computer Science – Data Structures and Algorithms
Scientific paper
2011-07-25
Computer Science
Data Structures and Algorithms
Scientific paper
Point-set embeddings and large-angle crossings are two areas of graph drawing that independently have received a lot of attention in the past few years. In this paper, we consider problems in the intersection of these two areas. Given the point-set-embedding scenario, we are interested in how much we gain in terms of computational complexity, curve complexity, and generality if we allow large-angle crossings as compared to the planar case. We investigate two drawing styles where only bends or both bends and edges must be drawn on an underlying grid. We present various results for drawings with one, two, and three bends per edge.
Fink Martin
Haunert Jan-Henrik
Mchedlidze Tamara
Spoerhase Joachim
Wolff Alexander
No associations
LandOfFree
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles 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 Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-572836