Graphs that admit right angle crossing drawings |
| |
Authors: | Karin Arikushi Radoslav Fulek Balázs Keszegh Filip Mori? Csaba D Tóth |
| |
Institution: | 1. University of Calgary, Canada;2. Ecole Polytechnique Fédérale de Lausanne, Switzerland;3. Alfréd Rényi Institute of Mathematics, Budapest, Hungary |
| |
Abstract: | We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a graph with n vertices admits a RAC drawing with at most 1 bend or 2 bends per edge, then the number of edges is at most 6.5n and 74.2n, respectively. This is a strengthening of a recent result of Didimo et al. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|