|
|||||
|
|
A characterization of complete bipartite RAC graphs |
|
| Authors: | Walter Didimo Peter Eades |
| Affiliation: | a University of Perugia, Italy b University of Sydney, Australia |
| Abstract: | A Right Angle Crossing drawing (RAC drawing for short) of a graph is such that edges can only cross at an angle of  . In this paper we provide a characterization of the complete bipartite graphs that admit a straight-line RAC drawing. |
| Keywords: | Computational geometry Combinatorial problems Graph algorithms Theory of computation |
| 本文献已被 ScienceDirect 等数据库收录！ | |