A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
A set P of points in R 2 is n-universal if every planar graph on n vertices admits a plane straight-line embedding on P . Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n ≥ 15. Conversely, we use a computer program to show that there exist universal point sets for all n ≤ 10 and to enumerate all corresponding order types. Finally, we describe a collection G of 7 393 planar graphs on 35 vertices that do not admit a simultaneous geometricdoi:10.1007/978-3-642-45281-9_3 fatcat:aw5pswv7ejcobhaphx7ldetrxa