Stabbing faces by a convex curve.
D. Eppstein.
arXiv:2508.17549.
33rd International Symposium on Graph Drawing and Network
Visualization.
Leibniz
International Proceedings in Informatics (LIPIcs) 357, 2025,
pp. 29:1–29:8, doi:10.4230/LIPIcs.GD.2025.29.
For each smooth convex curve \(C\), and each planar graph \(G\), there exists a straight-line drawing of \(G\) all of whose faces are crossed by \(C\). This result serves as a counterexample to an argument that universal point sets for planar graph drawing cannot be covered by few convex polygons.