Towards a General Solution to Drawing Area-Proportional Euler Diagrams

Abstract:

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.

Stirling Chow, Department of Computer Science, University of Victoria, Canada.
Frank Ruskey, Department of Computer Science, University of Victoria, Canada.

• The postscript file is ??? bytes, the dvi file is ??? bytes, the pdf file is 1,300,625 bytes.
• Presented at the First International Workshop on Euler Diagrams (Euler 2004), Brighton, England.
• Electronic Notes in Theoretical Computer Science, 134 (2005) 3-18.
• Selected papers which refer to this one:
  • Are there any?