Abstract
We determine tight bounds on the smallest-size integer grid needed to represent the n-node intersection graphs of a convex polygon P with P given in rational coordinates. The intersection graphs use only polygons that are geometrically similar to P (translates or homothets) and must be represented such that each corner
... read more