We show that every planar graph can be represented by a monotone topological 2-page book embedding where at most 15n/16 (of potentially 3n-6) edges cross the spine exactly once.

中文翻译：

---

带有少量 Biarc 的单调弧图

我们表明，每个平面图都可以用单调拓扑 2 页书嵌入表示，其中最多 15n/16（可能为 3n-6）条边恰好穿过书脊一次。