Journal of Algorithms
An optimal greedy heuristic to color interval graphs
Information Processing Letters
Reconstructing sets of orthogonal line segments in the plane
Discrete Mathematics
4-edge-coloring graphs of maximum degree 3 in linear time
Information Processing Letters
Drawing Graphs with Right Angle Crossings
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Discrete & Computational Geometry
Graphs that admit right angle crossing drawings
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings
Theory of Computing Systems
Manhattan-Geodesic embedding of planar graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
| Hi-index | 0.00 |
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.