Drawing planar graphs and 1-planar graphs using cubic Bézier
curves with bounded curvature.
D. Eppstein,
M. T. Goodrich, and
A. M. Illickan.
32nd International Symposium on Graph Drawing and Network
Visualization.
Leibniz
International Proceedings in Informatics (LIPIcs) 320, 2024,
pp. 39:1–39:17, doi:10.4230/LIPIcs.GD.2024.39.
arXiv:2410.12083.
1-planar graphs are the graphs that can be drawn in the plane with at most one crossing per edge. We show that we can make all crossings into right angles using Bézier spline curve edges.