Towards a General Solution to Drawing Area-Proportional Euler Diagrams

We present a deterministic algorithm for drawing Euler diagrams using n simple polygons so that the regions have a prescribed area. Our solution works for all Euler diagrams that have a region of common intersection (i.e., region {1, 2, . . . , n}), and for any weight function. When there is no region for {1, 2, . . . , n}, the algorithm can still be applied, but will sometimes create an Euler diagram where the curves are self-intersecting.