Two results on intersection graphs of polygons

Abstract

We prove asymptotically tight bounds on the number of corners that intersection graphs of polygons require in optimal representations. We also prove that computing this parameter is an NP-hard problem.