In this paper, we study tradeoffs between curve complexity and area of Right Angle Crossing drawings (RAC drawings), which is a challenging theoretical problem in graph drawing. Given a graph with $n$ vertices and $m$ edges, we provide a RAC drawing algorithm with curve complexity $6$ and area $O(n^{2.75})$, which takes time $O(n+m)$. Our algorithm improves the previous upper bound $O(n^3)$, by Di Giacomo et al., on the area of RAC drawings.

中文翻译：

---

亚立方区域的 RAC 图纸

在本文中，我们研究了曲线复杂性和直角交叉图（RAC 图纸）的面积之间的权衡，这是图形绘制中的一个具有挑战性的理论问题。给定一个具有 $n$ 个顶点和 $m$ 个边的图，我们提供了一个 RAC 绘图算法，其曲线复杂度为 $6$，面积为 $O(n^{2.75})$，这需要时间 $O(n+m)$。我们的算法改进了之前 Di Giacomo 等人在 RAC 图纸区域上的上限 $O(n^3)$。